Quantum local lemma for -QSAT on qubits, operator form (Corollary 16)
ProvedQLLL.PiQSAT.inf_ker_extendOp_ne_botLet be the single-qubit space and, for a finite set of qubits, let be Mathlib's tensor power. For a set the -qubit space splits as . Under this splitting a subspace of the local space extends to , and a local operator on extends to , where is the identity on the remaining qubits.
Let be sets of qubits and linear operators on such that:
- for every ;
- for every ;
- every qubit belongs to at most of the sets ;
- .
Then there is a nonzero state annihilated by every extended constraint:
This is Corollary 16 of Ambainis, Kempe and Sattath, the quantum analogue of the Lovász local lemma for -SAT: an instance of -local constraints of rank at most in which every qubit takes part in few constraints is satisfiable. The usual case is that each is an orthogonal projector, but the statement holds for arbitrary local operators of rank at most , since only the dimension of their kernels matters. The platform has four versions of Corollary 16: on Mathlib's tensor product, the operator form QLLL.PiQSAT.inf_ker_extendOp_ne_bot and the subspace form QLLL.PiQSAT.inf_extend_ne_bot; in the function model, the subspace form QLLL.QSAT.inf_ne_bot_of_degree_le, from which the others are derived, and the orthogonal-projector form QLLL.QSAT.satisfiable_of_degree_le.
Formalization Note Self-adjointness of the is not stated because the pinned Mathlib has no inner product on PiTensorProduct; it is not needed for the conclusion. The orthogonal-projector form, with the paper's exact hypotheses, is QLLL.QSAT.satisfiable_of_degree_le.
import Definitions.Def_QLLL_LocalLemma_Basic
import Definitions.Def_QLLL_Quantum_KQSAT_Basic
import Definitions.Def_QLLL_Quantum_KQSAT_QubitTensor
import Definitions.Def_QLLL_Quantum_KQSAT_PiTensor
import Mathlib
open TensorProduct Module
open QLLL QLLL.QSAT QLLL.QubitTensor
open QLLL
open QLLL.PiQSAT
variable {n : ℕ}theorem QLLL.PiQSAT.inf_ker_extendOp_ne_bot {m k r D' : ℕ} (S : Fin m → Finset (Fin n))
(P : ∀ i, Module.End ℂ (Qubits {j // j ∈ S i}))
(hcard : ∀ i, (S i).card = k)
(hrank : ∀ i, finrank ℂ (LinearMap.range (P i)) ≤ r)
(hdeg : ∀ v : Fin n, (Finset.univ.filter fun i => v ∈ S i).card ≤ D' + 1)
(hp : ((r : ℝ) / 2 ^ k) * Real.exp 1 * (((k * D' : ℕ) : ℝ) + 1) ≤ 1) :
(⨅ i, LinearMap.ker (extendOp (S i) (P i))) ≠ ⊥ := by sorry