The Complexity of the Local Hamiltonian Problem

@inproceedings{Kempe2004TheCO,
  title={The Complexity of the Local Hamiltonian Problem},
  author={Julia Kempe and Alexei Y. Kitaev and Oded Regev},
  booktitle={FSTTCS},
  year={2004}
}
The k-LOCAL HAMILTONIAN problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NPcomplete for k ≥ 2. It was known that the problem is QMA-complete for any k ≥ 3. On the other hand 1-LOCAL HAMILTONIAN is in P, and hence not believed to be QMA-complete. The complexity of the 2-LOCAL HAMILTONIAN problem has long been outstanding. Here we settle the question and show that it is QMA-complete. We provide two… CONTINUE READING
Highly Influential
This paper has highly influenced 21 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 136 extracted citations

Adiabatic Quantum Simulation of Quantum Chemistry

Scientific reports • 2014
View 5 Excerpts
Highly Influenced

Quantum information processing with superconducting circuits: a review.

Reports on progress in physics. Physical Society • 2017
View 5 Excerpts
Highly Influenced

Title of dissertation : CONTROL AND VERIFICATION OF QUANTUM MECHANICAL SYSTEMS

Dvir Kafri, Jacob M. Taylor Christopher Jarzynski Mohammad Hafezi Al Gorshkov
2015
View 10 Excerpts
Highly Influenced

Complexity Classification of Local Hamiltonian Problems

2014 IEEE 55th Annual Symposium on Foundations of Computer Science • 2014
View 9 Excerpts
Highly Influenced

On Physical Problems that are Slightly More Difficult than QMA

2014 IEEE 29th Conference on Computational Complexity (CCC) • 2014
View 7 Excerpts
Highly Influenced

The complexity of quantum spin systems on a two-dimensional square lattice

Quantum Information & Computation • 2010
View 10 Excerpts
Highly Influenced

Locality bounds on hamiltonians for stabilizer codes

Quantum Information & Computation • 2009
View 5 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 21 references

volume 47 of Graduate Studies in Mathematics

A. Yu. Kitaev, A. H. Shen, M. N. Vyalyi. Classical, quantum computation
AMS, Providence, RI, • 2002
View 9 Excerpts
Highly Influenced

Terhal

B R. Oliveira
The complexity of quantum spin systems on a twodimensional square lattice, • 2005
View 1 Excerpt

Quantum Arthur–Merlin games

computational complexity • 2004
View 3 Excerpts

Regev

O A. Ambainis
An elementary proof of the adiabatic theorem, • 2004

The complexity of the local hamiltonian problem

A. Kitaev, O. Regev.
Quantum Information & Computation • 2004

W

D. Aharonov
van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev. Adiabatic quantum computation is equivalent to standard quantum computation. In Proc. 45th FOCS, pages 42–51 • 2004
View 1 Excerpt

of 24th FSTTCS

J. Kempe, A. Kitaev, O. Regev. The complexity of the local hamiltonian pro Proc
pages 372–383, • 2004
View 1 Excerpt

3-local Hamiltonian is QMA-complete

Quantum Information & Computation • 2003
View 7 Excerpts

Similar Papers

Loading similar papers…