3-Local Hamiltonian is QMA-complete
Julia Kempe, Oded Regev
TL;DR
This paper proves that the problem of determining the ground state energy of 3-local Hamiltonians is as computationally hard as the hardest problems in QMA, reducing the locality from 5 to 3.
Contribution
It demonstrates that 3-local Hamiltonian problem is QMA-complete, improving the known bounds on the problem's complexity.
Findings
3-local Hamiltonian problem is QMA-complete
Reduces the locality from 5 to 3 in the Hamiltonian problem
Establishes the computational hardness of 3-local Hamiltonians
Abstract
It has been shown by Kitaev that the 5-local Hamiltonian problem is QMA-complete. Here we reduce the locality of the problem by showing that 3-local Hamiltonian is already QMA-complete.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Geometry · Algebraic structures and combinatorial models · Geometric and Algebraic Topology