Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1010.5577

Another Quantum Lovász Local Lemma

Mingsheng Ying

Published Oct 27, 2010• 0 citations
arXivHTMLPDF

Abstract

We define a natural conceptual framework in which a generalization of the Lovász Local Lemma can be established in quantum probability theory.
DOI
10.48550/arxiv.1010.5577

Related papers

An analogue of Hunt's representation theorem in quantum probability

Alberto Barchielli, Alexander Semenovich Holevo, G. Lupieri

Journal of Theoretical Probability•Apr 1, 1993•18 citations

A quantum lovász local lemma

Andris Ambainis, Julia Kempe, Or Sattath

The Lovasz Local Lemma (LLL) is a powerful tool in probability theory to show the existence of combinatorial objects meeting a prescribed collection of "weakly dependent" criteria. We show that the LLL extends to a much more general geometric setting, where events are replaced with subspaces and probability is replaced with relative dimension, which allows to lower bound the dimension of the intersection of vector spaces under certain independence conditions.

ACM Symposium on Theory of Computing (STOC)•Jun 5, 2010•8 citations

Quantum Lovász local lemma: Shearer’s bound is tight

Kun He, Qian Li, Xiaoming Sun +1 more

Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to show the possibility of avoiding all “bad” events under some “weakly dependent” condition. Over the last decades, the algorithmic aspect of LLL has also attracted lots of attention in theoretical computer science. A tight criterion under which the abstract version LLL (ALLL) holds was given by Shearer. It turns out that Shearer’s bound is generally not tight for variable version LLL (VLLL). Recently, Ambainis et al. introduced a quantum version LLL (QLLL), which was then shown to be powerful for the quantum satisfiability problem.

arXiv:1804.07055•ACM Symposium on Theory of Computing (STOC)•Jun 20, 2019•9 citations

Probability theories in general and quantum theory in particular

Lucién Hardy

Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics•Jun 9, 2003•16 citations

Some remarks on classical probability theory in quantum mechanics

Gerhard Gerlich

Erkenntnis•Nov 1, 1981•1 citation

A constructive quantum Lovasz local lemma for commuting projectors

Or Sattath, Itai Arad

The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors. The Quantum Lov\'asz Local Lemma gives a sufficient condition for a Quantum Satisfiability problem to be satisfiable~\cite{ambainis2012quantum}, by generalizing the classical Lov\'asz Local Lemma. The next natural question that arises is: can a satisfying quantum state be \emph{efficiently} found, when these conditions hold? In this work we present such an algorithm, with the additional requirement that all the projectors commute. The proof follows the information theoretic proof given by Moser's breakthrough result in the classical setting~\cite{moser2009constructiveSTOC}. Similar results were independently published in~\cite{cubitt2011constructive, cubitt2013quantum}.

arXiv:1310.7766•Quantum Information and Computation•Sep 1, 2015•15 citations
Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to show the possibility of avoiding all “bad” events under some “weakly dependent” condition. Over the last decades, the algorithmic aspect of LLL has also attracted lots of attention in theoretical computer science. A tight criterion under which the abstract version LLL (ALLL) holds was given by Shearer. It turns out that Shearer’s bound is generally not tight for variable version LLL (VLLL). Recently, Ambainis et al. introduced a quantum version LLL (QLLL), which was then shown to be powerful for the quantum satisfiability problem.
The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors. The Quantum Lov\'asz Local Lemma gives a sufficient condition for a Quantum Satisfiability problem to be satisfiable~\cite{ambainis2012quantum}, by generalizing the classical Lov\'asz Local Lemma. The next natural question that arises is: can a satisfying quantum state be \emph{efficiently} found, when these conditions hold? In this work we present such an algorithm, with the additional requirement that all the projectors commute. The proof follows the information theoretic proof given by Moser's breakthrough result in the classical setting~\cite{moser2009constructiveSTOC}. Similar results were independently published in~\cite{cubitt2011constructive, cubitt2013quantum}.