Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Quantum local lemma for kkk-QSAT with local satisfying spaces of dimension at least 2k−r2^k - r2k−r

Proved
QLLL.QSAT.inf_lift_ne_bot

by sattath · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

k-qsatquantum-informationquantum-lll

Model the state space of nnn qubits as Hn=C{0,1}n\mathcal{H}_n = \mathbb{C}^{\{0,1\}^n}Hn​=C{0,1}n, the functions from bit strings to C\mathbb{C}C, and for a subspace X⊆HnX \subseteq \mathcal{H}_nX⊆Hn​ write R(X)=dim⁡X/2n\mathrm{R}(X) = \dim X / 2^nR(X)=dimX/2n for its relative dimension. For a set SSS of qubits and a subspace YYY of the local space C{0,1}S\mathbb{C}^{\{0,1\}^S}C{0,1}S, let liftS(Y)⊆Hn\mathrm{lift}_S(Y) \subseteq \mathcal{H}_nliftS​(Y)⊆Hn​ be the space of states all of whose SSS-slices (obtained by fixing the bits outside SSS) lie in YYY; in tensor language this is Y⊗C{0,1}ScY \otimes \mathbb{C}^{\{0,1\}^{S^c}}Y⊗C{0,1}Sc.

Let S1,…,SmS_1, \dots, S_mS1​,…,Sm​ be sets of qubits with ∣Si∣=k|S_i| = k∣Si​∣=k, and for each iii let Yi⊆C{0,1}SiY_i \subseteq \mathbb{C}^{\{0,1\}^{S_i}}Yi​⊆C{0,1}Si​ be a local subspace with dim⁡Yi≥2k−r\dim Y_i \ge 2^k - rdimYi​≥2k−r (the satisfying space of a constraint of rank at most rrr on the qubits SiS_iSi​). Suppose every qubit belongs to at most D′+1D' + 1D′+1 of the sets SiS_iSi​ and

r2k⋅e⋅(kD′+1) ≤ 1.\frac{r}{2^{k}} \cdot e \cdot (k D' + 1) \ \le\ 1.2kr​⋅e⋅(kD′+1) ≤ 1.

Then

⋂i=1mliftSi(Yi) ≠ {0}.\bigcap_{i=1}^{m} \mathrm{lift}_{S_i}(Y_i) \ \neq\ \{0\}.i=1⋂m​liftSi​​(Yi​) = {0}.

This is Corollary 16 of Ambainis, Kempe and Sattath phrased in terms of the local satisfying spaces: a kkk-QSAT instance whose constraints have rank at most rrr and in which every qubit is acted on by at most D′+1D' + 1D′+1 constraints has a nonzero satisfying state.

Formalization Note 2k−r2^k - r2k−r is truncated subtraction of natural numbers. The paper's hypothesis "every qubit appears in at most D=2k/(erk)D = 2^k/(e r k)D=2k/(erk) projectors" implies the condition above with D′=D−1D' = D - 1D′=D−1. Qubits are modelled as functions on bit strings, ({0,1}n→C)(\{0,1\}^n \to \mathbb{C})({0,1}n→C), rather than by Mathlib's PiTensorProduct. The identification of the two models is proved in the source project (QuantumLocalLemma/Quantum/KQSAT/QubitTensor.lean) and enters the platform inside the proof of QLLL.PiQSAT.inf_extend_ne_bot, the statement of the corollary on Mathlib's tensor product.

Preamble
import Definitions.Def_QLLL_LocalLemma_Basic
import Definitions.Def_QLLL_Quantum_KQSAT_Basic
import Mathlib

open QLLL
open QLLL.QSAT
open Finset Module
variable {n : ℕ}
Formal statement
theorem QLLL.QSAT.inf_lift_ne_bot {m : ℕ} {Sq : Fin m → Finset (Fin n)}
    {Y : (i : Fin m) → Submodule ℂ (HIn (Sq i))} {k r D' : ℕ}
    (hcard : ∀ i, (Sq i).card = k)
    (hrank : ∀ i, 2 ^ k - r ≤ Module.finrank ℂ (Y i))
    (hdeg : ∀ v : Fin n, (univ.filter fun i => v ∈ Sq i).card ≤ D' + 1)
    (hp : ((r : ℝ) / 2 ^ k) * Real.exp 1 * (((k * D' : ℕ) : ℝ) + 1) ≤ 1) :
    univ.inf (fun i => lift (Sq i) (Y i)) ≠ ⊥ := by sorry
Source
A. Ambainis, J. Kempe, O. Sattath, A Quantum Lovász Local Lemma, J. ACM 59(5):24 (2012), arXiv:0911.1696 (numbering of the arXiv version), Corollary 16

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me