The complexity of the local Hamiltonian problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3328, Issue , 2004, Pages 372-383

  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

[No Author keywords available]

Indexed keywords

HAMILTONIANS; LINEAR ALGEBRA; PERTURBATION TECHNIQUES; QUANTUM COMPUTERS; SOFTWARE ENGINEERING;

ADIABATIC COMPUTATION; COMPLETE PROBLEMS; COMPLEXITY CLASS; HAMILTONIAN PROBLEMS; LOCAL HAMILTONIANS; LOCAL INTERACTIONS; NP COMPLETE; PERTURBATION THEORY; QUANTUM ANALOG;

QUANTUM COMPUTERS; HAMILTONIANS;

EID: 34147163913     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_31     Document Type: Article

References (13)

1. Papadimitriou, C.: Computational Complexity. Addison Wesley, Reading, Massachusetts (1994)
2. Knill, E.: Quantum randomness and nondeterminism (1996) quant-ph/9610012.
3. Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and quantum computation. Volume 47 of Graduate Studies in Mathematics. AMS, Providence, RI (2002)
4. Watrous, J.: Succinct quantum proofs for properties of finite groups. In: Proc. 41st FOCS. (2000) 537-546
5. Janzing, D., Wocjan, P., Beth, T.: Identity check is QMA-complete (2003) quant-ph/0305050.
6. Aharonov, D., Naveh, T.: Quantum NP - a suryey (2002) quant-ph/0210077.
7. Kempe, J., Regev, O.: 3-local Hamiltonian is QMA-complete. Quantum Inf. Comput. 3 (2003) 258-264
8. Wocjan, P., Beth, T.: The 2-local Hamiltonian problem encompasses NP. International J. of Quantum Info. 1 (2003) 349-357
9. Bravyi, S., Vyalyi, M.: Commutative version of the k-local Hamiltonian problem and non-triviality check for quantum codes (2003) quant-ph/0308021.
10. Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. In: Proc. 45th FOCS. (2004) quant-ph/0405098.
11. Marriott, C., Watrous, J.: Quantum Arthur-Merlin games. In: Proc. of 19th IEEE Annual Conference on Computational Complexity (CCC). (2004)
12. Rudin, W.: Functional analysis. Second edn. International Series in Pure and Applied Mathematics. McGraw-Hill Inc., New York (1991)
13. Abrikosov, A.A., Gorkov, L.P., Dzyaloshinski, I.E.: Methods of quantum field theory in statistical physics. Dover Publications Inc., New York (1975)