Claim 3.11 — subrank on the selected logical spaces
OpenQuantumCupGates644.ConstantWeight.Supplement.claim_3_11Let Γ be a finite directed graph of total incident degree at most Δ≥2, let F be a field, and let r≥2. Assume Γ is oriented from one bipartition class to the other, or F has characteristic two. Let be the chosen local systems. Let M⊆E(Γ) be extendable for the first r−1 Tanner codes, and assume their local Schur product lies in the rth local image. The codes Q^(i) and protected spaces L^(i) are the actual cyclic tensor construction and Equation (12).
Let f̃ denote the form induced by Equation (14) on the cohomology quotients. Its restriction to the specified protected Z spaces has
Subrank means that logical vectors can be chosen so the form on their r-tuples is exactly the diagonal tensor with coefficient one. This supplies the logical yield of the source gate.
Differences from the source:
- encoding: one-based finite coordinate sets and quotient logical spaces → Fin labels and full-preimage logical subspaces; reason: the relabellings are bijective and the published CSS convention represents the same quotients
- generalization: finite directed graphs → finite edge-labelled loopless directed graphs, also allowing parallel edges; reason: the proof uses incidence and total incident degree only; simple source graphs are included without changing any bound
import Definitions.Def_QuantumCupGates644_ConstantWeight_Supplement_cup
namespace QuantumCupGates644.ConstantWeight.Supplement
open scoped BigOperators
open Classical
theorem claim_3_11
(F : Type) [Field F] (G : Graph) (r Δ : ℕ) (hr : 2 ≤ r) (hΔ : 2 ≤ Δ)
(S : Fin r → LocalSystem F G) (hdeg : G.DegreeAtMost Δ)
(horient : G.LeftToRight ∨ (2 : F) = 0)
(M : Finset (Fin G.ne)) (hM : Extendable S M) (hmul : Multiplication S) :
SubrankAtLeast (sourceForm S) (productSubsystem S) (M.card^r) := by sorry
end QuantumCupGates644.ConstantWeight.Supplement