The complexity of the local hamiltonian problem

SIAM Journal on Computing

Volumn 35, Issue 5, 2006, Pages 1070-1097

  Kempe, Julia ^a,b   Kitaev, Alexei ^c   Regev, Oded ^d  

^a CNRS   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

Adiabatic computation; Complete problems; Local Hamiltonian problem; Quantum computation

Indexed keywords

ADIABATIC COMPUTATION; COMPLETE PROBLEMS; LOCAL HAMILTONIAN PROBLEM; QUANTUM COMPUTATION;

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; HAMILTONIANS; LINEAR ALGEBRA; PERTURBATION TECHNIQUES;

PROBLEM SOLVING;

EID: 33750165209     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539704445226     Document Type: Article

References (21)

1. A. A. ABRIKOSOV, L. P. GORKOV, AND I. E. DZYALOSHINSKI, Methods of Quantum Field Theory in Statistical Physics, Dover, New York, 1975.
2. D. AHARONOV AND T. NAVEH, Quantum NP-A survey, 2002; available online from http://www.arxiv.org/abs/quant-ph/0210077.
3. D. AHARONOV, W. VAN DAM, J. KEMPE, Z. LANDAU, S. LLOYD, AND O. REGEV, Adiabatic quantum computation is equivalent to standard quantum computation, in Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, 2004, pp. 42-51.
4. A. AMBAINIS AND O. REGEV, An elementary proof of the quantum adiabatic theorem, 2004; available online from http://www.arxiv.org/abs/quant-ph/0411152.
5. D. BARENCO, C. H. BENNETT, R. CLEVE, D. P. DIVINCENZO, N. MARGOLUS, P. SHOR, T. SLEATOR, J. SMOLIN, AND H. WEINFURTER, Elementary gates for quantum computation, Phys. Rev. A, 52 (1995), pp. 3457-3467.
6. R. BHATIA, Matrix Analysis, Grad. Texts in Math. 169, Springer-Verlag, New York, 1997.
7. S. BRAVYI AND M. VYALYI, Commutative version of the k-local Hamiltonian problem and nontriviality check for quantum codes, Quantum Inf. Comput., 5 (2005), pp. 187-215.
8. E. FARHI, J. GOLDSTONE, S. GUTMANN, AND M. SIPSER, Quantum computation by adiabatic evolution, 2000; available online from http://www.arxiv.org/abs/ quant-ph/0001106.
9. D. JANZING, P. WOCJAN, AND T. BETH, "Non-identity-check" is QMA-complete, Internat. J. Quantum Inform., 3 (2005), pp. 463-473.
10. J. KEMPE, A. KITAEV, AND O. REGEV, The complexity of the local Hamiltonian problem, in Proceedings of the 24th Annual FSTTCS, Lecture Notes in Comput. Sci. 3328, Springer-Verlag, Berlin, 2004, pp. 372-383.
11. J. KEMPE AND O. REGEV, 3-local Hamiltonian is QMA-complete, Quantum Inf. Comput., 3 (2003), pp. 258-264.
12. A. Y. KITAEV, A. H. SHEN, AND M. N. VYALYI, Classical and quantum computation, Grad. Stud. Math. 47, AMS, Providence, RI, 2002.
13. E. KNILL, Quantum randomness and nondeterminism, 1996; available online from http://www.arxiv.org/abs/quant-ph/9610012.
14. C. MARRIOTT AND J. WATROUS, Quantum Arthur-Merlin games, in Proceedings of the 19th IEEE Annual Conference on Computational Complexity (CCC), 2004, pp. 344-354.
15. M. NIELSEN AND I. CHUANG, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
16. R. OLIVEIRA AND B. TERHAL, The complexity of quantum spin systems on a two-dimensional square lattice, 2005; available online from http://www.arxiv. org/abs/quant-ph/0504050.
17. C. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
18. B. REICHARDT, The quantum adiabatic optimization algorithm and local minima, in Proceedings of the 36th Annual STOC, ACM, 2004, pp. 502-510.
19. W. RUDIN, Functional Analysis, 2nd ed., International Series in Pure and Applied Mathematics, McGraw-Hill Inc., New York, 1991.
20. J. WATROUS, Succinct quantum proofs for properties of finite groups, in Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, 2000, pp. 537-546.
21. P. WOCJAN AND T. BETH, The 2-local Hamiltonian problem encompasses NP, Internat. J. Quantum Inform., 1 (2003), pp. 349-357.