-QSAT with orthogonal projectors of rank at most and bounded qubit degree is satisfiable (Corollary 16, the paper's setting)
ProvedQLLL.QSAT.satisfiable_of_degree_leModel the state space of qubits as . A -QSAT instance on qubits consists of constraints , each given by a set of exactly qubits and a matrix on that is an orthogonal projector: idempotent () and self-adjoint (). The instance is satisfiable if there is a nonzero state with for every , where is the identity on the remaining qubits.
Suppose every has rank at most , every qubit belongs to at most of the sets , and
Then the instance is satisfiable.
This is Corollary 16 of Ambainis, Kempe and Sattath for -QSAT instances given by projectors, the quantum analogue of Corollary 2 for -SAT with the same parameters. For rank-one projectors it gives Corollary 5. It is the form in the paper's exact physical setting and the only form on the platform that states self-adjointness of the constraints. 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 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 is used for the forms on Mathlib's tensor product. The projector condition is Mathlib's IsStarProjection. Self-adjointness cannot yet be stated for the tensor-product forms because the pinned Mathlib has no inner product on PiTensorProduct.
import Definitions.Def_QLLL_LocalLemma_Basic
import Definitions.Def_QLLL_Quantum_KQSAT_Basic
import Definitions.Def_QLLL_Quantum_KQSAT_Projector
import Mathlib
open QLLL
open QLLL.QSAT
open scoped Matrix Kronecker
open WithLp (toLp ofLp)
variable {n : ℕ}theorem QLLL.QSAT.satisfiable_of_degree_le {k r D' : ℕ} (I : QSATInstance n k)
(hrank : ∀ i, (I.proj i).rank ≤ r)
(hdeg : ∀ v : Fin n,
(Finset.univ.filter fun i => v ∈ I.qubits i).card ≤ D' + 1)
(hp : ((r : ℝ) / 2 ^ k) * Real.exp 1 * (((k * D' : ℕ) : ℝ) + 1) ≤ 1) :
I.Satisfiable := by sorry