css_quasi_transversal_ccz_code
A CSS quantum code of block length n specified by a 3 by n logical X-operator matrix K and an s by n X-stabilizer matrix S over ZMod 2 has quasi-transversal CCZ if it has Z-distance at least 3 and satisfies the nine Campbell-Howard conditions.
Statement
def css_quasi_transversal_ccz_code (n s : ℕ) (K : Matrix (Fin 3) (Fin n) (ZMod 2)) (S : Matrix (Fin s) (Fin n) (ZMod 2)) : Prop
- Defined in
- arXiv:2610.09341 Thm 3.3
- Verified
- 19 Oct 2026
- Axioms
- none listed
- Built on 2
- campbell_howard_conditionsThe nine Campbell-Howard conditions for a logical X-matrix K of 3 rows and an X-stabilizer matrix S of s rows over ZMod 2: the logical…
- css_z_distance_ge_threeA CSS quantum code specified by a k by n logical X-operator matrix K and an s by n X-stabilizer matrix S over ZMod 2 has Z-distance at…
- Used by 4
- op_159_css_ccz_no_code_s_zeroFor any block length n, no 3 by n logical X-operator matrix K and 0 by n X-stabilizer matrix S over ZMod 2 form a CSS quasi-transversal…
- op_159_css_ccz_stabilizer_rank_ge_twoFor any block length n, if a 3 by n logical matrix K and an s by n stabilizer matrix S over ZMod 2 form a CSS quasi-transversal CCZ code,…
- op_159_css_ccz_no_code_s_oneFor any block length n, no 3 by n logical X-operator matrix K and 1 by n X-stabilizer matrix S over ZMod 2 form a CSS quasi-transversal…
- not_css_quasi_transversal_ccz_code_zeroThe zero logical and stabilizer matrices over ZMod 2 do not form a CSS quasi-transversal CCZ code of any block length n and stabilizer…
Read back from the Lean
The definition css_quasi_transversal_ccz_code n s K S is a predicate on two matrices $K \in (\mathbb{Z}/2\mathbb{Z})^{3 \times n}$ and $S \in (\mathbb{Z}/2\mathbb{Z})^{s \times n}$ asserting that both css_z_distance_ge_three K S and campbell_howard_conditions K S hold:
1. css_z_distance_ge_three K S: For every vector $v \in (\mathbb{Z}/2\mathbb{Z})^n$, if $S v = 0$ and $K v \neq 0$, then the Hamming weight of $v$ (the number of coordinates $j \in \{0, \dots, n-1\}$ such that $v_j \neq 0$) is at least 3.
2. campbell_howard_conditions K S: The matrices $K$ and $S$ satisfy nine algebraic conditions over $\mathbb{Z}/2\mathbb{Z}$:
- (a) For every row index $i \in \{0, 1, 2\}$, the sum of the entries of row $i$ of $K$ is $0 \pmod 2$.
- (b) For all row indices $i < i'$ in $\{0, 1, 2\}$, the dot product of row $i$ and row $i'$ of $K$ is $0 \pmod 2$.
- (c) The sum over all columns $j \in \{0, \dots, n-1\}$ of the entrywise product $K_{0, j} K_{1, j} K_{2, j}$ equals $1 \pmod 2$.
- (d) For all $i \in \{0, 1, 2\}$ and $l \in \{0, \dots, s-1\}$, row $i$ of $K$ and row $l$ of $S$ are orthogonal (their dot product is $0 \pmod 2$).
- (e) For all $i < i'$ in $\{0, 1, 2\}$ and $l \in \{0, \dots, s-1\}$, the sum over columns $j$ of $K_{i, j} K_{i', j} S_{l, j}$ is $0 \pmod 2$.
- (f) For all $i \in \{0, 1, 2\}$ and $l < l'$ in $\{0, \dots, s-1\}$, the sum over columns $j$ of $K_{i, j} S_{l, j} S_{l', j}$ is $0 \pmod 2$.
- (g) For every row index $l \in \{0, \dots, s-1\}$, the sum of the entries of row $l$ of $S$ is $0 \pmod 2$.
- (h) For all row indices $l < l'$ in $\{0, \dots, s-1\}$, row $l$ and row $l'$ of $S$ are orthogonal ($0 \pmod 2$).
- (i) For all row indices $l < l' < l''$ in $\{0, \dots, s-1\}$, the sum over columns $j$ of $S_{l, j} S_{l', j} S_{l'', j}$ is $0 \pmod 2$.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A CSS code has quasi-transversal CCZ if it has Z-distance at least 3 and satisfies the nine Campbell-Howard conditions. -/ def css_quasi_transversal_ccz_code (n s : ℕ) (K : Matrix (Fin 3) (Fin n) (ZMod 2)) (S : Matrix (Fin s) (Fin n) (ZMod 2)) : Prop := css_z_distance_ge_three K S ∧ campbell_howard_conditions K S