DeepAI AI Chat
Log In Sign Up

Quantum Lovász Local Lemma: Shearer's Bound is Tight

by   Kun He, et al.
Alibaba Group
Institute of Computing Technology, Chinese Academy of Sciences

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 holds was given by Shearer [shearer1985problem]. It turns out that Shearer's bound is generally not tight for variable version LLL (VLLL) [he2017variable]. Recently, Ambainis et al. introduced a quantum version LLL (QLLL), which was then shown to be powerful for quantum satisfiability problem. In this paper, we prove that Shearer's bound is tight for QLLL, affirming a conjecture proposed by Sattath et. al. Our result shows the tightness of Gilyén and Sattath's algorithm, and implies that the lattice gas partition function fully characterizes quantum satisfiability for almost all Hamiltonians with large enough qudits. Commuting LLL (CLLL), LLL for commuting local Hamiltonians which are widely studied in literature, is also investigated here. We prove that the tight regions of CLLL and QLLL are generally different. Thus, the efficient region of algorithms for CLLL can go beyond shearer's bound. Our proof is by first bridging CLLL and VLLL on a family of interaction bipartite graphs and then applying the tools of VLLL, e.g., the gapless/gapful results, to CLLL. We also provide a sufficient and necessary condition for deciding whether the tight regions of QLLL and CLLL are the same for a given interaction bipartite graph.


page 1

page 2

page 3

page 4


Moser-Tardos Algorithm: Beyond Shearer's Bound

In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos develop...

Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants

In a recent breakthrough result, Balliu et al. [FOCS'19] proved a determ...

Variable Version Lovász Local Lemma: Beyond Shearer's Bound

A tight criterion under which the abstract version Lovász Local Lemma (a...


We show that the class MIP* of languages that can be decided by a classi...

A Stronger Impossibility for Fully Online Matching

We revisit the fully online matching model (Huang et al., J. ACM, 2020),...

A Tight Lower Bound for Index Erasure

The Index Erasure problem asks a quantum computer to prepare a uniform s...

The Lovász Local Lemma is Not About Probability

Given a collection of independent events each of which has strictly posi...