arXiv:2609.39395
Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes
Mohammad Rowshan, Simon Devitt
Abstract
Bivariate bicycle (BB) quantum codes are a prominent finite-length family of quantum low-density parity-check codes, but their minimum distance is usually established numerically rather than read from the defining polynomials. We study the $Z$-logical quotient $K/S$ over $\mathbb F_2[x,y]/(x^\ell-1,y^m-1)$ and show that it fits into a short exact sequence with an annihilator quotient as kernel and a colon quotient as cokernel. The sequence gives an explicit logical basis, a dimension formula, and a componentwise distance identity $d_Z=\min(d_{\mathcal A},d_{\mathcal C})$. Using the Frobenius structure of the finite group algebra, we prove $r_{\mathcal A}=r_{\mathcal C}=k/2$ for every BB code, including repeated-root cases. The algebraic component of a logical class is distinct from the support shape of its lightest representatives: an annihilator class can have a lighter two-block representative, and a colon class can have a one-sided minimum. For lower bounds we show that every proper subset of a minimum-weight logical operator has nonzero syndrome, and that this property persists inside the colon component but not inside the annihilator component. A translation-anchored cluster search built on it proves the distances $4,6,10,10,12,18$ of the six standard BB codes of lengths $18$ to $288$ and enumerates every minimum-weight logical operator. The resulting census shows that $[[108,8,10]]$ is the only one of the six whose distance is attained in a single component, with $d_{\mathcal C}=10$ and $d_{\mathcal A}=12$.
AI Summary
Bivariate bicycle (BB) quantum LDPC codes have algebraically specified checks, but their minimum distances are generally determined by search. This paper organizes the distance problem through the logical quotient $K/S$, where $K=\{(u,v):au+bv=0\}$ and $S=\{(br,ar)\}$ over the finite torus group algebra. A short exact sequence identifies an annihilator-derived kernel $\operatorname{ann}(a)/b\operatorname{ann}(a)$ and a colon quotient $(a:b)/(a)$. It yields explicit logical bases, and a Frobenius-pairing argument proves that both spaces have dimension $k/2$, including repeated-root cases. Partitioning logical classes by whether their colon coordinate vanishes gives $d_Z=\min(d_{\mathcal A},d_{\mathcal C})$, with exact coset-leader formulations. These algebraic labels do not determine minimum-representative support: for $[[18,4,4]]$, the lightest left-only annihilator representative weighs six, but its component distance is four. For lower bounds, minimum-weight logicals are shown to have no proper nonempty zero-syndrome subset. A translation-anchored cluster search exploits this property to prove distances $4,6,10,10,12,18$ for six standard codes of lengths $18,72,90,108,144,288$, confirming the previously reported upper bound of eighteen at length 288. Complete minimum-weight enumeration finds that only $[[108,8,10]]$ attains its distance in one component: $d_{\mathcal C}=10$ and $d_{\mathcal A}=12$. The decomposition is not a closed-form distance solution: weight minimizations remain combinatorial, and verification is exponential in target distance. The component-specific connectivity argument works for colon minima but not generally for annihilator minima. Decoder performance, circuit-level noise, and proposed operational applications are not evaluated.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 15 pages,10 figures, 9 tables