The complexity of stoquastic local Hamiltonian problems

Quantum Information and Computation

Volumn 8, Issue 5, 2008, Pages 0361-0385

  Bravyi, Sergey ^a   Divincenzo, David P ^a   Oliveira, Roberto ^a   Terhal, Barbara M ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

QUANTUM COMPUTERS;

ADIABATIC QUANTUM COMPUTATION; COMPLEXITY CLASS; DENSITY MATRIX; LOCAL HAMILTONIANS; NATURAL WORLD; NON NEGATIVES; OFF-DIAGONAL MATRIX ELEMENTS; STANDARD BASIS;

HAMILTONIANS;

EID: 47249119832     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (31)

1. S.R. White. Density Matrix Formulation for Quantum Renormalization Groups. Phys. Rev. Lett., 69:2863, 1992.
2. S. Rommer and S. Ostlund. A Class of Ansatz wave Functions for 1D Spin Systems and their Relation to DMRG. 55:2164, 1997.
3. F. Verstraete, D. Porras, and J.I. Cirac. DMRG and Periodic Boundary Conditions: a Quantum Information Perspective. Phys. Rev. Lett., 93:227205, 2004.
4. N. Trivedi and D. Ceperley. Ground-state Correlations of Quantum Antiferromagnets: A Green's function Monte-Carlo study. 41:4552, 1990.
5. M. Buonaura and S. Sorella. Numerical Study of the Two-Dimensional Heisenberg model using a Green's function Monte-Carlo Technique with a Fixed Number of Walkers. 57:11446, 1998.
6. A. Yu. Kitaev, A.H. Shen, and M.N. Vyalyi. Classical and Quantum Computation. Vol. 47 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI, 2002.
7. J. Kempe, A. Kitaev, and O. Regev. The Complexity of the Local Hamiltonian Problem. SIAM Journal of Computing, 35(5):1070-1097, 2006. Earlier version in Proc. of 24th FSTTCS.
8. R.I. Oliveira and B.M. Terhal. The Complexity of Quantum Spin Systems on a Two-Dimensional Square Lattice. 2005, http://arxiv.org/abs/quant-ph/0504050.
9. J. Watrous. Succinct Quantum Proofs for Properties of Finite Groups. In Proceedings of 41st FOCS, pages 537-546, 2000, http://arxiv.org/abs/cs.CC/ 0009002.
10. E. Farhi, J. Goldstone, S. Gutmann, J. Lapan, A. Lundgren, and D. Preda. A Quantum Adiabatic Evolution Algorithm applied to Random Instances of an NP-complete problem. Science, 292:472- -476, 2001.
11. D. M. Ceperley. Path Integrals in the Theory of Condensed Helium. Rev. Mod. Phys. 67, 279-356, 1995.
12. G. Burkard, R. H. Koch, and D. P. DiVincenzo. Multi-level Quantum Description of Decoher ence in Superconducting Flux Qubits. Phys. Rev. B 69, 064503, 2004. http://arxiv.org/abs/cond-mat/0308025.
13. D. F. Walls and G. J. Milburn. Quantum Optics. Springer, New York, 1995.
14. See, e.g., A. J. Leggett, S. Chakravarty, A. T. Dorsey, M. P. A. Fisher, A. Garg, and W. Zwerger. Dynamics of the Dissipative Two-State System. Rev. Mod. Phys. 59:2-86, 1987.
15. D. Aharonov and A. Ta-Shma. Adiabatic Quantum State Generation and Statistical Zero Knowledge. http://arxiv.org/abs/quant-ph/quant-ph/0301023. In Proceedings 35th ACM Symp. on Theory of Computing, pp. 20-29, 2003.
16. C. L. Henley, From Classical to Quantum Dynamics at Rokhsar-Kivelson Points. J. Phys.: Condens. Matter 16 S891 (2004) http://arxiv.org/abs/cond-mat/ 0311345
17. F. Verstraete, M. M. Wolf, D. Perez-Garcia, and J. I. Cirac. Criticality, the Area Law, and the Computational Power of PEPS. http://arxiv.org/abs/quant- ph/0601075.
18. M. Suzuki. Relationship between d-dimensional Quantum Spin Systems and (d+1)-dimensional Ising systems. Prog. Theor. Phys., 56(5):1454-1469, 1976.
19. F. Barahona. On the Computational Complexity of Ising Spin Glass Models. Jour. of Phys. A: Math. and Gen., 15:3241-3253, 1982.
20. S. Goldwasser and M. Sipser. Private Coins versus Public Coins in Interactive Proof Systems. In Proceedings of 18th STOC, pages 59-68, 1986.
21. J. L. Carter and M. N. Wegman. Universal Classes of Hash Functions. Journal of Computer and Systems Sciences, 18(2):143-154, 1979.
22. A. Bessen, S. Bravyi and B.M. Terhal. Merlin-Arthur Games and Stoquastic Complexity 2006, http://arxiv.org/abs/quant-ph/0611021
23. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.
24. L. Babai. Trading Group Theory for Randomness. In Proceedings of 17th STOC, pages 421-429, 1985.
25. M. Furer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos. On Completeness and Soundness in Interactive Proof Systems. Advances in Computing Research, 5:429-442, 1989.
26. D. Aharonov and T. Naveh. Quantum NP-A Survey. 2002, http://arxiv.org/ abs/quant-ph/0210077.
27. S. Aaronson. Quantum Computing, Postselection, and Probabilistic Polynomial-Time. http: //arxiv.org/abs/quant-ph/quant-ph/0412187. Electronic Colloquium on Computational Complexity (ECCC) Vol. 12, No. 003, 2005.
28. Y. Han, L. Hemaspaandra, and T. Thierauf. Threshold Computation and Cryptographic Security. SIAM J. Comput., 26(1):59-78, 1997.
29. R. Bhatia, editor. Matrix analysis. Springer, New York, 1997.
30. D. Aharonov, W. van Dam, Z. Landau, S. Lloyd, J. Kempe, and O. Regev. Universality of Adiabatic Quantum Computation. In Proceedings of 45th FOCS, 2004, http://arxiv.org/abs/quant-ph/0405098.
31. L.L. Ng. Heisenberg Model, Bethe Ansatz and Random Walks. Harvard University, 1996.