Claim 4.2 — induced graph and puncture bijection
OpenQuantumCupGates644.ConstantWeight.Supplement.claim_4_2coding-theoryp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1quantum-error-correctionquantum-information
Let n≥0 and t≥2, and let Γ(n,t), its layers V_i and puncture E=⊔E_i be the actual induced column graph of §4.1. The coordinate-deletion map ed is a bijection from E to the graph edges, and its two endpoints delete coordinates i and i+1 from a point in E_i. The graph is bipartite and
The edge-intersection coordinate also recovers the original puncture point. This pins down the geometry used for the local Tanner constraints, including the empty n=0 case.
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
Preamble
import Definitions.Def_QuantumCupGates644_ConstantWeight_Supplement_punctured
Formal statement
namespace QuantumCupGates644.ConstantWeight.Supplement
open scoped BigOperators
open Classical
theorem claim_4_2 (n t : ℕ) (ht : 2 ≤ t) :
(∃ ed : PuncturePoint n t ≃ Fin (puncturedGraph n t).ne,
∀ a, let e := (Fintype.equivFin (ColumnEdge n t)).symm (ed a)
e.val.1 = deletedColumn a ⟨a.1.val, by have := a.1.isLt; omega⟩ ∧
e.val.2 = deletedColumn a ⟨a.1.val+1, by have := a.1.isLt; omega⟩ ∧
edgePoint e = puncturePoint a) ∧
(puncturedGraph n t).Bipartite ∧
∀ v : Fin (puncturedGraph n t).nv,
((puncturedGraph n t).incident v).card =
if (vertexLayer v).val = 0 ∨ (vertexLayer v).val+1 = t then n else 2*n := by sorry
end QuantumCupGates644.ConstantWeight.Supplement
Source
Louis Golowich, Itzhak Tamo, Guanyu Zhu, STOC 2027 submission #644 (October 2026); canonical source.pdf, SHA-256 4f5444723e907920327c3fb5432396e702dbb3d8f705e0deeb5bf9b833e17439; Claim 4.2, printed/PDF p.25