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

Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

Volumn 467, Issue 2126, 2011, Pages 459-472

  Bremner, Michael J ^a   Jozsa, Richard ^b   Shepherd, Dan J ^c  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c CESG   (United Kingdom)

Author keywords

Polynomial hierarchy; Quantum computational complexity; Quantum simulation

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; POLYNOMIALS; QUANTUM CHEMISTRY; QUANTUM COMPUTERS; QUANTUM THEORY;

BOUNDED ERRORS; CLASSICAL SIMULATION; COMPLEXITY CLASS; MULTIPLICATIVE ERRORS; OUTPUT DISTRIBUTION; POLYNOMIAL HIERARCHIES; QUANTUM COMPUTATION; QUANTUM COMPUTATIONAL COMPLEXITY; QUANTUM SIMULATION; THIRD LEVEL; TOTAL VARIATION;

PROBABILITY DISTRIBUTIONS;

EID: 79551623422     PISSN: 13645021     EISSN: 14712946     Source Type: Journal    
DOI: 10.1098/rspa.2010.0301     Document Type: Conference Paper

References (21)

1. Aaronson, S. 2005 Quantum computing, post-selection and probabilistic polynomial-time. Proc. R. Soc. A 461, 3473-3483. (doi:10.1098/rspa.2005.1546)
2. Aaronson, S. 2009 BQP and the polynomial hierarchy, (http://arxiv.org/ abs/0910.4698)
3. Aaronson, S. & Arkhipov, A. 2010 New evidence that quantum mechanics is hard to simulate on classical computers. Talk at QIP2010, Thirteenth International Workshop on Quantum Information Processing, ETH Zurich, Zurich, Switzerland, 18-22 January 2010.
4. Aliferis, P., Brito, F., DiVincenzo, D. P., Preskill, J., Steffen, M. & Terhal, B. M. 2009 Fault- tolerant computing with biased-noise superconducting qubits. New J. Phys. 11, 013061. (http://arxiv.org/abs/0806. 0383)
5. Arora, S. & Barak, B. 2009 Computational complexity: a modern approach. Cambridge, UK: Cambridge University Press.
6. Browne, D., Kashefi, E. & Perdrix, S. 2009 Computational depth complexity of measurement-based quantum computation, (http://arxiv.org/abs/0909. 4673).
7. Fenner, S., Green, F., Homer, S. & Zhang, Y. 2005 Bounds on the power of constant-depth quantum circuits. In Proc. 15th Int. Symp. Fundamentals of Computation Theory, Lübeck, Germany, 17-20 August 2005, pp. 44-55. Lecture Notes in Computer Science. Berlin, Germany: Springer.
8. Gottesman, D. & Chuang, I. 1999 Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations. Lett. Nat. 402, 390-393. (doi: 10.1038/46503)
9. Han, Y., Hemaspaandra, L. & Thierauf, T. 1997 Threshold computation and cryptographic security. SIAM J. Comput. 26, 59-78. (doi:10.1137/ S0097539792240467)
10. Jordan, S. 2009 Permutational quantum computing, (http://arxiv.org/abs/ 0906.2508).
11. Jozsa, R., Kraus, B., Miyake, A. & Watrous, J. 2009 Matchgate and space-bounded quantum computations are equivalent. Proc. R. Soc. A 466, 809-830. (doi:10.1098/rspa.2009.0433)
12. Kuperberg, G. 2009 How hard is it to approximate the Jones polynomial? (http://arxiv.org/abs/0908.0512).
13. Nielsen, M. 2006 Cluster state quantum computation. Rep. Math. Phys. 57, 147-161. (doi:10.1016/S0034-4877(06)80014-5) (Pubitemid 43812137)
14. Nielsen, M. & Chuang, I. 2000 Quantum computation and quantum information. Cambridge, UK: Cambridge University Press.
15. Papadimitriou, C. 1994 Computational complexity. Reading, MA: Addison Wesley Publishing Company.
16. Shepherd, D. J. 2009 Quantum complexity: restrictions on algorithms and architectures. PhD thesis, University of Bristol, Bristol, UK.
17. Shepherd, D. 2010 Binary matroids and quantum probability distributions. (http://arxiv.org/abs/1005.1744).
18. Shepherd, D. & Bremner, M. J. 2009 Temporally unstructured quantum computation. Proc. R. Soc. A 465, 1413-1439. (doi:10.1098/rspa.2008.0443)
19. Terhal, B. & DiVincenzo, D. 2004 Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games. Quant. Inf. Comp. 4, 134-145. (http://arxiv.org/abs/quant-ph/0205133).
20. Toda, S. 1991 PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20, 865-877. (doi:10.1137/0220053)
21. van den Nest, M. 2009 Simulating quantum computers with probabilistic methods. (http://arxiv.org/abs/0911.1624).