BQP-Complete Problems

[1]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[2]  Martin Grohe.  The complexity of homomorphism and constraint satisfaction problems seen from the other side , 2007, JACM.

[3]  Shengyu Zhang,et al.  Several natural BQP-Complete problems , 2006, quant-ph/0606179.

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

[5]  Dorit Aharonov,et al.  The BQP-hardness of approximating the Jones polynomial , 2006, ArXiv.

[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]  Christos H. Papadimitriou,et al.  NP-Completeness: A Retrospective , 1997, ICALP.

[8]  H. Trotter.  On the product of semi-groups of operators , 1959 .

[9]  V. Jones.  A polynomial invariant for knots via von Neumann algebras , 1985 .

[10]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[11]  Ben Reichardt,et al.  Span-program-based quantum algorithm for evaluating formulas , 2007, Theory Comput..

[12]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[13]  Alexei Y. Kitaev,et al.  Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..

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

[15]  Andris Ambainis,et al.  Any AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer , 2010, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[16]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[17]  N R Cozzarelli,et al.  Equilibrium distributions of topological states in circular DNA: interplay of supercoiling and knotting. , 1999, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Michael Larsen,et al.  A Modular Functor Which is Universal¶for Quantum Computation , 2000, quant-ph/0001108.

[19]  R. Cleve,et al.  Efficient Quantum Algorithms for Simulating Sparse Hamiltonians , 2005, quant-ph/0508139.

[20]  Paul R. Chernoff,et al.  Note on product formulas for operator semigroups , 1968 .

[21]  Andrew M. Childs,et al.  Quantum algorithms for algebraic problems , 2008, 0812.0380.

[22]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[23]  Amnon Ta-Shma,et al.  Adiabatic quantum state generation and statistical zero knowledge , 2003, STOC '03.

[24]  M. Freedman,et al.  Topological Quantum Computation , 2001, quant-ph/0101025.

[25]  Peter W. Shor,et al.  Progress in Quantum Algorithms , 2004, Quantum Inf. Process..

[26]  C. Lomont.  THE HIDDEN SUBGROUP PROBLEM - REVIEW AND OPEN PROBLEMS , 2004, quant-ph/0411037.

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

[28]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[29]  Frédéric Magniez,et al.  Search via quantum walk , 2006, STOC '07.

[30]  Greg Kuperberg.  A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem , 2005, SIAM J. Comput..

[31]  Sanjeev Arora,et al.  Computational Complexity: A Modern Approach , 2009 .

[32]  Andrew M. Childs,et al.  Universal computation by quantum walk. , 2008, Physical review letters.

[33]  F. Y. Wu.  The Potts model , 1982 .

[34]  Richard J. Lipton,et al.  Word Problems Solvable in Logspace , 1977, JACM.

[35]  Alan D. Sokal.  The multivariate Tutte polynomial (alias Potts model) for graphs and matroids , 2005, Surveys in Combinatorics.

[36]  M H Freedman,et al.  P/NP, and the quantum field computer , 1998, Proc. Natl. Acad. Sci. USA.

[37]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[38]  D. Aharonov,et al.  Polynomial Quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane Preliminary Version , 2008 .

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

[40]  Raymond Laflamme,et al.  Quantum computing and quadratically signed weight enumerators , 2001, Inf. Process. Lett..

[41]  M. Freedman,et al.  Simulation of Topological Field Theories¶by Quantum Computers , 2000, quant-ph/0001071.

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

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

[44]  Pawel Wocjan,et al.  A Simple PromiseBQP-complete Matrix Problem , 2007, Theory Comput..

[45]  B. Bollobás.  Surveys in Combinatorics , 1979 .

[46]  H. Briegel,et al.  One-way Quantum Computation - a tutorial introduction , 2006, quant-ph/0603226.

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

[48]  Andrew M. Childs,et al.  ANY AND-OR FORMULA OF SIZE N CAN BE EVALUATED IN TIME N1/2+o(1) ON A QUANTUM COMPUTER , 2010 .

[49]  F. Y. Wu.  Knot theory and statistical mechanics , 1992 .

[50]  Andrew Chi-Chih Yao,et al.  Quantum Circuit Complexity , 1993, FOCS.

[51]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[52]  D. Janzing,et al.  A single-shot measurement of the energy of product states in a translation invariant spin chain can replace any quantum computation , 2007, 0710.1615.

[53]  Oded Goldreich,et al.  Computational complexity: a conceptual perspective , 2008, SIGA.

[54]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[55]  Pawel Wocjan,et al.  The Jones polynomial: quantum algorithms and applications in quantum complexity theory , 2008, Quantum Inf. Comput..