arXiv:2609.36213
Bivariate Bicycle Codes over Group Algebras
Chaobin Liu
Abstract
We study a weighted-shift formulation of bivariate bicycle group-algebra (BBGA) codes over finite group algebras. One binary shift acts by right multiplication and the other by left multiplication; associativity ensures that these shifts commute even for a nonabelian seed group. Bivariate polynomials in the shifts, including mixed monomials, therefore define CSS codes. We give explicit sparsity bounds and distinguish nonabelian seed groups from codes that are intrinsically inequivalent to abelian realizations. For $D_3$, a pair of weighted permutation shifts generates a regular $C_6\times C_{12}$ action and recovers the known $[[144,12,12]]$ and $[[144,14,14]]$ bivariate bicycle codes. We also present a computer-verified $[[144,16,12]]$ code over $A_4\times C_6$, with every check of weight eight. This example belongs to the established nonabelian two-block group-algebra family. Exhaustive low-weight enumeration and an intrinsic stabilizer-support invariant certify that it is inequivalent to any ordinary abelian BB or two-block group-algebra realization, even under qubit permutations combined with local Clifford operations. Finally, a nonuniform weighted-shift construction over $\mathbb{F}_2[C_3]$ yields a $[[18,4,3]]$ code with check weights six and eight. An exact enumeration of its minimum stabilizer supports rules out every ordinary binary 2BGA realization at that length, under the same equivalence. This establishes that the unrestricted weighted-shift formulation extends beyond the ordinary 2BGA class, even with an abelian seed group.
AI Summary
The paper asks when weighted-shift descriptions of bicycle-type CSS codes produce codes genuinely outside ordinary group-algebra constructions. It defines commuting binary shifts using right and left multiplication over $\mathbb F_2[G]$, evaluates bivariate polynomials in them, and derives check-weight bounds. The left–right commutation mechanism and ordinary two-block group-algebra (2BGA) specialization are established constructions. For group-element seeds, the shifts generate abelian permutation actions; a nonabelian seed group therefore need not produce an intrinsically nonabelian code. A $D_3$ construction realizes a regular $C_6\times C_{12}$ action and recovers the known $[[144,12,12]]$ and $[[144,14,14]]$ BB codes. Sparse group-algebra sums over $A_4\times C_6$ give a $[[144,16,12]]$ code with weight-eight checks. Exact rank calculations, explicit logical operators, and exhaustive syndrome comparisons certify its parameters. Enumeration identifies all 144 minimum-weight stabilizer supports; their incidence graph has automorphism group of order 12, excluding the order-72 translation symmetry required by an ordinary abelian 2BGA realization, even up to qubit permutations and local Clifford operations. This example remains within nonabelian 2BGA. Nonuniform, singular shift labels over $\mathbb F_2[C_3]$ yield a $[[18,4,3]]$ code with checks of weights six and eight. Exact enumeration finds 38 minimum stabilizer supports of weight six, incompatible with translation-orbit divisibility for every length-18 ordinary 2BGA code. This establishes strict extension beyond that class under the same equivalence. No asymptotic, decoding, syndrome-extraction, or parameter-optimality advantage is established. Broader lifted-product realizations and equivalence under entangling Clifford transformations are not excluded.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.