3-local Hamiltonian is QMA-complete

Quantum Information and Computation

Volumn 3, Issue 3, 2003, Pages 258-264

  Kempe, Julia ^a,b   Regev, Oded ^c  

^a CNRS   (France)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

Complete problems; Local Hamiltonian problem; QMA

Indexed keywords

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

COMPLETE PROBLEMS; HAMILTONIAN PROBLEMS; LOCAL HAMILTONIANS; QMA-COMPLETE;

HAMILTONIANS;

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

References (5)

1. C. Papadimitriou. Computational Complexity. Addison Wesley, Reading, Massachusetts, 1994.
2. D. Aharonov and T. Naveh, Quantum NP - a survey. In quant-ph/0210077, http://xxx.lanl.gov, 2002.
3. A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi. Classical and quantum computation, volume 47 of Graduate Studies in Mathematics. AMS, 2002.
4. P. Wocjan and T. Beth. The 2-local Hamiltonian problem encompasses NP. In quant-ph/0301087, http://xxx.lanl.gov, 2003.
5. D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev. Universality of adiabatic quantum computation with two-body interactions. In preparation.