pith. sign in

arxiv: 1311.6474 · v1 · pith:ZF5GVVQBnew · submitted 2013-11-25 · 🪐 quant-ph · cs.CC

An Information-Theoretic Proof of the Constructive Commutative Quantum Lov\'asz Local Lemma

classification 🪐 quant-ph cs.CC
keywords quantumlocalalgorithmbeenclassicalgroundhamiltonianlemma
0
0 comments X
read the original abstract

The Quantum Lov\'asz Local Lemma (QLLL) [AKS12] establishes non-constructively that any quantum system constrained by a local Hamiltonian has a zero-energy ground state, if the local Hamiltonian terms overlap only in a certain restricted way. In this paper, we present an efficient quantum algorithm to prepare this ground state for the special case of commuting projector terms. The related classical problem has been open for more than 34 years. Our algorithm follows the breakthrough ideas of Moser's [Moser09] classical algorithm and lifts his information theoretic argument to the quantum setting. A similar result has been independently published by Arad and Sattath [AS13] recently.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.