9 Bivariate-bicycle foundations
Bivariate-bicycle codes are qLDPC codes built from two commuting polynomial shift operators on an abelian group. QECLean provides the general cover, doubling, small-cycle, and certificate soundness theorems.
The data exhibiting one bivariate-bicycle complex as a free double cover of another: a deck transformation \(\sigma \) of order two acting freely, commuting with both boundary maps, with the base recovered as the quotient. The gross \([[144,12,12]]\) code covers the \([[72,12,6]]\) base exactly this way, and the doubling of the distance from \(6\) to \(12\) is what the cover is used to prove.
The finite data certifying that a bivariate-bicycle complex has no light cycles: an enumeration showing that every nonzero cycle of weight below the target floor would produce an impossible syndrome pattern.
From a definition 79 certificate, every nonzero cycle has weight at least six.
The certificate rules out weights one through five by a finite case analysis on the possible supports, each case contradicting the syndrome constraint \(\partial _1 c = 0\). The enumeration is checked in the kernel rather than by compiled evaluation, so the result carries no compiler-trust axiom.
The concrete Gross \([[144,12,12]]\) and Bravyi360 \([[360,12,24]]\) proofs, including their generated certificates, now live in bb-distance-lean. That repository pins QECLean and retains the Gross blueprint annotations in BBDistanceBlueprint.lean.