Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

Publisher:
The Royal Society
Publication Type:
Journal Article
Citation:
Proceedings Of The Royal Society A-Mathematical Physical And Engineering Sciences, 2011, 467 (2126), pp. 459 - 472
Issue Date:
2011-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013003973OK.pdf311.64 kB
Adobe PDF
We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that the task of sampling their output probability distributions is unlikely to be achievable by any efficient classical means. More specifically, we introduce the class post-IQP of languages decided with bounded error by uniform families of IQP circuits with post-selection, and prove first that post-IQP equals the classical class PP. Using this result we show that if the output distributions of uniform IQP circuit families could be classically efficiently sampled, either exactly in total variation distance or even approximately up to 41 per cent multiplicative error in the probabilities, then the infinite tower of classical complexity classes known as the polynomial hierarchy would collapse to its third level. We mention some further results on the classical simulation properties of IQP circuit families, in particular showing that if the output distribution results from measurements on only O(log n) lines then it may, in fact, be classically efficiently sampled.
Please use this identifier to cite or link to this item: