On preparing ground states of gapped Hamiltonians: An efficient Quantum Lov\'asz Local Lemma
Andr\'as Gily\'en, Or Sattath

TL;DR
This paper presents an efficient quantum algorithm for preparing frustration-free ground states of gapped Hamiltonians, extending previous results to non-commuting terms under Shearer's bound and using only local measurements.
Contribution
It introduces a new algorithm that efficiently constructs frustration-free ground states for non-commuting Hamiltonians with a polynomial energy gap, generalizing prior commuting-case methods.
Findings
Algorithm works efficiently for non-commuting terms
Uses only local measurement operations
Applies under Shearer's bound for the Quantum Lovász Local Lemma
Abstract
A frustration-free local Hamiltonian has the property that its ground state minimises the energy of all local terms simultaneously. In general, even deciding whether a Hamiltonian is frustration-free is a hard task, as it is closely related to the QMA1-complete quantum satisfiability problem (QSAT) -- the quantum analogue of SAT, which is the archetypal NP-complete problem in classical computer science. This connection shows that the frustration-free property is not only relevant to physics but also to computer science. The Quantum Lov\'asz Local Lemma (QLLL) provides a sufficient condition for frustration-freeness. A natural question is whether there is an efficient way to prepare a frustration-free state under the conditions of the QLLL. Previous results showed that the answer is positive if all local terms commute. In this work we improve on the previous constructive results by…
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.
