Quantum Computational Complexity

This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of quantum complexity classes based on these notions, such as BQP, QMA, and QIP, are presented. Other topics in quantum complexity, including quantum advice, space-bounded quantum computation, and bounded-depth quantum circuits, are also discussed.

[1]  Allan Borodin,et al.  Parallel Computation for Well-Endowed Rings and Space-Bounded Probabilistic Machines , 1984, Inf. Control..

[2]  Charles H. Bennett,et al.  Logical reversibility of computation , 1973 .

[3]  Daniel A. Spielman,et al.  PP is closed under intersection , 1991, STOC '91.

[4]  Leonard M. Adleman,et al.  Quantum Computability , 1997, SIAM J. Comput..

[5]  Bill Rosgen,et al.  Distinguishing Short Quantum Computations , 2007, STACS.

[6]  Sandy Irani,et al.  The Power of Quantum Systems on a Line , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[7]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  Uriel Feige,et al.  Making games short (extended abstract) , 1997, STOC '97.

[9]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[10]  D. Deutsch.  Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[11]  William Slofstra,et al.  Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[12]  Kirk Pruhs,et al.  Non-Preemptive Min-Sum Scheduling with Resource Augmentation , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[13]  Steven Homer,et al.  Small depth quantum circuits , 2007, SIGA.

[14]  Barbara M. Terhal,et al.  The complexity of quantum spin systems on a two-dimensional square lattice , 2008, Quantum Inf. Comput..

[15]  John Watrous,et al.  Space-Bounded Quantum Complexity , 1999, J. Comput. Syst. Sci..

[16]  Kirk Pruhs,et al.  Speed scaling to manage energy and temperature , 2007, JACM.

[17]  Keiji Matsumoto,et al.  Quantum multi-prover interactive proof systems with limited prior entanglement , 2001, J. Comput. Syst. Sci..

[18]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[19]  W. Stinespring.  Positive functions on *-algebras , 1955 .

[20]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[21]  Mihir Bellare,et al.  Free bits, PCPs and non-approximability-towards tight results , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[22]  Oded Goldreich,et al.  On Promise Problems (a survey in memory of Shimon Even [1935-2004]) , 2005, Electron. Colloquium Comput. Complex..

[23]  Sanjeev Arora,et al.  Probabilistic checking of proofs: a new characterization of NP , 1998, JACM.

[24]  Scott Aaronson,et al.  QMA/qpoly Is Contained In PSPACE/poly: De-Merlinizing Quantum Protocols , 2005, Electron. Colloquium Comput. Complex..

[25]  Julia Kempe,et al.  The Complexity of the Local Hamiltonian Problem , 2004, FSTTCS.

[26]  Keiji Matsumoto,et al.  Entangled Games are Hard to Approximate , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[27]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[28]  Mikhail N. Vyalyi,et al.  Classical and Quantum Computation , 2002, Graduate studies in mathematics.

[29]  Greg Kuperberg,et al.  Quantum versus Classical Proofs and Advice , 2006, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[30]  D. Du,et al.  Theory of Computational Complexity , 2000 .

[31]  Endre Szemerédi,et al.  On the Complexity of Matrix Group Problems I , 1984, FOCS.

[32]  László Babai.  Bounded Round Interactive Proofs in Finite Groups , 1992, SIAM J. Discret. Math..

[33]  Peter Høyer,et al.  Consequences and limits of nonlocal strategies , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[34]  Matthias Christandl,et al.  Quantum computational complexity of the N-representability problem: QMA complete. , 2007, Physical review letters.

[35]  Ronald de Wolf,et al.  Quantum communication and complexity , 2002, Theor. Comput. Sci..

[36]  Martin Nilsson,et al.  Parallel Quantum Computation and Quantum Codes , 2001, SIAM J. Comput..

[37]  Eric Allender,et al.  Relationships among PL, #L, and the determinant , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[38]  John Watrous,et al.  PSPACE has constant-round quantum interactive proof systems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[39]  Harumichi Nishimura,et al.  Polynomial time quantum computation with advice , 2003, Inf. Process. Lett..

[40]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[41]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[42]  Dorit Aharonov,et al.  Quantum NP - A Survey , 2002, quant-ph/0210077.

[43]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[44]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[45]  John Watrous,et al.  Zero-knowledge against quantum attacks , 2005, STOC '06.

[46]  Alain Tapp,et al.  All Languages in NP Have Very Short Quantum Proofs , 2007, 2009 Third International Conference on Quantum, Nano and Micro Technologies.

[47]  Ran Raz.  Quantum Information and the PCP Theorem , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[48]  John Watrous,et al.  Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[49]  Lance Fortnow,et al.  Complexity limitations on quantum computation , 1999, J. Comput. Syst. Sci..

[50]  Irit Dinur,et al.  The PCP theorem by gap amplification , 2006, STOC.

[51]  Mihir Bellare,et al.  Free Bits, PCPs, and Nonapproximability-Towards Tight Results , 1998, SIAM J. Comput..

[52]  R. Feynman.  Simulating physics with computers , 1999 .

[53]  Amnon Ta-Shma,et al.  Quantum expanders and the quantum entropy difference problem , 2007 .

[54]  Yi-Kai Liu.  Consistency of Local Density Matrices Is QMA-Complete , 2006, APPROX-RANDOM.

[55]  Gus Gutoski,et al.  Toward a general theory of quantum games , 2006, STOC '07.

[56]  E. Knill.  Quantum Randomness and Nondeterminism , 1996 .

[57]  Tommaso Toffoli,et al.  Reversible Computing , 1980, ICALP.

[58]  G. Brassard,et al.  Quantum Communication Complexity , 2003 .

[59]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 2005, computational complexity.

[60]  Julia Kempe,et al.  The Unique Games Conjecture with Entangled Provers is False , 2007, Algebraic Methods in Computational Complexity.

[61]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[62]  Chris Marriott,et al.  Quantum Arthur–Merlin games , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[63]  Salil P. Vadhan,et al.  The Complexity of Zero Knowledge , 2007, FSTTCS.

[64]  Stuart A. Kurtz,et al.  Gap-Definable Counting Classes , 1994, J. Comput. Syst. Sci..

[65]  Pawel Wocjan,et al.  "NON-IDENTITY-CHECK" IS QMA-COMPLETE , 2005 .

[66]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[67]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[68]  Keiji Matsumoto,et al.  Using Entanglement in Quantum Multi-Prover Interactive Proofs , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.

[69]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[70]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[71]  A. Kitaev.  Quantum computations: algorithms and error correction , 1997 .

[72]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[73]  SahaiAmit,et al.  A complete problem for statistical zero knowledge , 2003 .

[74]  Oded Goldreich,et al.  Comparing entropies in statistical zero knowledge with applications to the structure of SZK , 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

[75]  R. Cleve.  An Introduction to Quantum Complexity Theory , 1999, quant-ph/9906111.

[76]  Noam Nisan,et al.  Quantum circuits with mixed states , 1998, STOC '98.

[77]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[78]  Dieter van Melkebeek,et al.  A Quantum Time-Space Lower Bound for the Counting Hierarchy , 2008, Electron. Colloquium Comput. Complex..

[79]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[80]  Bill Fefferman,et al.  The Power of Unentanglement , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[81]  Raymond Laflamme,et al.  An Introduction to Quantum Computing , 2007, Quantum Inf. Comput..

[82]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[83]  Ingo Wegener,et al.  Complexity Theory , 2005 .

[84]  Seth Lloyd,et al.  Adiabatic quantum computation is equivalent to standard quantum computation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[85]  John Watrous,et al.  On the complexity of simulating space-bounded quantum computations , 2004, computational complexity.

[86]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[87]  Scott Aaronson,et al.  Limitations of quantum advice and one-way communication , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[88]  John Watrous,et al.  Limits on the power of quantum statistical zero-knowledge , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[89]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[90]  Scott Aaronson,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.

[91]  L. Fortnow.  Counting complexity , 1998 .

[92]  Yong Zhang,et al.  Bounds on the Power of Constant-Depth Quantum Circuits , 2005, FCT.

[93]  Salman Beigi,et al.  On the Complexity of Computing Zero-Error and Holevo Capacity of Quantum Channels , 2007, 0709.2090.

[94]  S. Lloyd.  Ultimate physical limits to computation , 1999, Nature.

[95]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[96]  Eric Allender,et al.  Relationships Among PL, #L, and the Determinant , 1996, RAIRO Theor. Informatics Appl..

[97]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[98]  Alexei Y. Kitaev,et al.  Parallelization, amplification, and exponential time simulation of quantum interactive proof systems , 2000, STOC '00.

[99]  E. Knill.  Approximation by Quantum Circuits , 1995 .

[100]  Stephanie Wehner,et al.  Entanglement in Interactive Proof Systems with Binary Answers , 2005, STACS.

[101]  Amit Sahai,et al.  A complete promise problem for statistical zero-knowledge , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[102]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[103]  Richard Cleve,et al.  Fast parallel circuits for the quantum Fourier transform , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[104]  Keiji Matsumoto,et al.  Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? , 2009, Chic. J. Theor. Comput. Sci..

[105]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[106]  Scott Aaronson,et al.  Quantum lower bound for the collision problem , 2001, STOC '02.

[107]  Bill Rosgen,et al.  On the hardness of distinguishing mixed-state quantum computations , 2004, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[108]  U. Feige,et al.  Making Games Short , 2006 .

[109]  Hirotada Kobayashi,et al.  General Properties of Quantum Zero-Knowledge Proofs , 2007, TCC.