On the Complexity of Two Dimensional Commuting Local Hamiltonians
Dorit Aharonov, Oded Kenneth, Itamar Vigdorovich

TL;DR
This paper proves that a broad class of two-dimensional commuting local Hamiltonians on surfaces have groundstates that can be efficiently generated by quantum circuits, advancing understanding of their computational complexity.
Contribution
It establishes that 2D CLHs on surface complexes are in NP and their groundstates are efficiently preparable, generalizing previous results and addressing a major open problem.
Findings
Class of 2D CLHs on surface complexes is in NP.
Groundstates of these CLHs can be prepared by efficient quantum circuits.
Generalizes previous special case results to broader classes of 2D CLHs.
Abstract
The complexity of the commuting local Hamiltonians (CLH) problem still remains a mystery after two decades of research of quantum Hamiltonian complexity; it is only known to be contained in NP for few low parameters. Of particular interest is the tightly related question of understanding whether groundstates of CLHs can be generated by efficient quantum circuits. The two problems touch upon conceptual, physical and computational questions, including the centrality of non-commutation in quantum mechanics, quantum PCP and the area law. It is natural to try to address first the more physical case of CLHs embedded on a 2D lattice but this problem too remained open, apart from some very specific cases. Here we consider a wide class of two dimensional CLH instances; these are -local CLHs, for any constant ; they are defined on qubits set on the edges of any surface complex, where we…
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.
