Quantum local lemma for -QSAT with local satisfying spaces of dimension at least
ProvedQLLL.QSAT.inf_lift_ne_botModel the state space of qubits as , the functions from bit strings to , and for a subspace write for its relative dimension. For a set of qubits and a subspace of the local space , let be the space of states all of whose -slices (obtained by fixing the bits outside ) lie in ; in tensor language this is .
Let be sets of qubits with , and for each let be a local subspace with (the satisfying space of a constraint of rank at most on the qubits ). Suppose every qubit belongs to at most of the sets and
Then
This is Corollary 16 of Ambainis, Kempe and Sattath phrased in terms of the local satisfying spaces: a -QSAT instance whose constraints have rank at most and in which every qubit is acted on by at most constraints has a nonzero satisfying state.
Formalization Note is truncated subtraction of natural numbers. The paper's hypothesis "every qubit appears in at most projectors" implies the condition above with . Qubits are modelled as functions on bit strings, , 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.
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 : ℕ}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