Description
A 2BGA code LP\((a,b)\) whose group \(G\) is Abelian, equivalently a multi-dimensional index-two quasi-cyclic code. Since any finite Abelian group is a direct product of cyclic groups, the group algebra elements \(a\) and \(b\) can be treated as multivariate polynomials. The family includes GB (one variable), bivariate bicycle (two variables), and higher-variable codes, providing some of the best known short codes with small stabilizer weights.
Writing \(G=\mathbb{Z}_{\ell_1}\times \mathbb{Z}_{\ell_2}\times \cdots \times \mathbb{Z}_{\ell_D}\), the elements \(a\) and \(b\) become \(D\)-variate polynomials in \(\mathbb{F}_q[x_1,\ldots,x_D]/\langle x_1^{\ell_1}-1,\ldots,x_D^{\ell_D}-1 \rangle\), yielding stabilizer generator matrices \begin{align}
The decomposition of \(G\) into cyclic factors, and hence the number of variables \(D\), is not unique (see the MM code entry). For example, \(\mathbb{Z}_{15}\) yields a GB code in one variable, whereas the isomorphic \(\mathbb{Z}_{5}\times\mathbb{Z}_{3}\) yields a bivariate bicycle code in two variables.
Qubit Abelian 2BGA codes in \(r\) variables have been studied in the trivariate (\(r=3\)) case, in which a third, dependent variable \(z=xy\) supplements the two variables of a bivariate bicycle code [5]. Such codes with check weight at most six admit bi-planar (thickness-two) Tanner graphs, and there is a criterion for determining whether a code admits a toric layout [5]. Weight-five examples, such as a \([[30,4,5]]\) code, admit bi-planar toric layouts with a single long-range connection per check and depth-seven syndrome-extraction circuits, whereas weight-four codes can instead admit tangled toric layouts [5].
Protection
The code dimension \(k\) of an Abelian 2BGA code is always even [2]. Bounds on code parameters and an enumeration of codes with small row weights, including codes with \(kd \geq n\), are given in Ref. [3].Gates
Several qubit Abelian 2BGA codes admit fault-tolerant logical circuits implemented via transversal operations combined with qubit permutations, obtained from code automorphism groups [5].Certain qubit Abelian 2BGA codes admit a constant-depth inter-code logical \(CZ\) gate between two copies of the code via the 2-copy-cup gate [6]. The gate exists when the check polynomials satisfy a pre-orientation condition equivalent to a graph perfect-matching problem [6]. Examples include the \([[16,6,4]]\) copy-cup code and check-weight-six codes such as \([[72,8,6]]\), \([[108,12,6]]\), and \([[144,16,6]]\) [6].Code Capacity Threshold
Qubit Abelian 2BGA families with fixed check weight and polynomially growing distance have vanishing rate [7]. When such a family has a unique threshold, its optimal code capacity threshold under bit-flip noise is constrained by the Kramers-Wannier self-duality of zero-rate PSD codes [7].Cousins
- Galois-qudit HGP code— An Abelian 2BGA code whose elements \(a\) and \(b\) are supported on subgroups intersecting trivially is a square-matrix hypergraph-product code constructed from a pair of classical group-algebra codes [3; Statements 8 and 12]. Elements given by polynomials in disjoint sets of variables satisfy this condition. See the cyclic HGP code entry for the case of two cyclic codes.
- Lattice stabilizer code— Qubit Abelian 2BGA codes admitting a toric layout have translationally invariant checks on a torus whose dimension is the number of independent variables [5].
- Permutationally self-dual (PSD) CSS code— Qubit Abelian 2BGA codes are permutationally self-dual [3; Thm. 6]. Exchanging the two blocks of qubits while inverting each group element is an involutive \(XZ\)-duality [8; Sec. 3].
- Haah cubic code (CC)— CSS cubic codes are Abelian 2BGA codes over the group \(G=\mathbb{Z}_{L}^{\times 3}\) [9; Sec. III.A]; e.g., cubic code 1 corresponds to group-algebra elements \(a = 1+x+y+z\) and \(b = 1+xy+xz+yz\) [10].
- Tricycle code— The qubit Abelian 2BGA code defined by \(a\) and \(b\) is a 2D component code of the tricycle code defined by \(a\), \(b\), and \(c\) [11]. A one-way transversal CNOT from the tricycle code to the Abelian 2BGA code yields teleportation-based code switching between the two codes [11]. This holds when \(|G|\) is odd and \(c\) lies in the ideal \((a,b)\) [11; Appx. C].
Primary Hierarchy
References
- [1]
A. A. Kovalev and L. P. Pryadko, “Quantum Kronecker sum-product low-density parity-check codes with finite rate”, Physical Review A 88, (2013) arXiv:1212.6703 DOI
- [2]
G. V. Kalachev and P. A. Panteleev, “On the minimum distance in one class of quantum LDPC codes”, Intelligent systems. Theory and applications 24(4), 87-117 (2020)
- [3]
H.-K. Lin and L. P. Pryadko, “Quantum two-block group algebra codes”, (2023) arXiv:2306.16400
- [4]
S. Yang and R. Calderbank, “Spatially-Coupled QLDPC Codes”, Quantum 9, 1693 (2025) arXiv:2305.00137 DOI
- [5]
L. Voss, S. J. Xian, T. Haug, and K. Bharti, “Multivariate Bicycle Codes”, (2025) arXiv:2406.19151
- [6]
R. Tiew and N. P. Breuckmann, “Copy-cup Gates in Tensor Products of Group Algebra Codes”, (2026) arXiv:2602.23307
- [7]
L. H. English, H. Luo, Y. Wang, B. Srivastava, S. D. Bartlett, and D. J. Williamson, “Duality constrains optimal thresholds in quantum error correction”, (2026) arXiv:2607.21160
- [8]
J. N. Eberhardt and V. Steffan, “Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes”, (2024) arXiv:2407.03973
- [9]
P. Panteleev and G. Kalachev, “Quantum LDPC Codes With Almost Linear Minimum Distance”, IEEE Transactions on Information Theory 68, 213 (2022) arXiv:2012.04068 DOI
- [10]
F. A. Mian, O. Gwilliam, and S. Krastanov, “Multivariate Multicycle Codes for Complete Single-Shot Decoding”, (2026) arXiv:2601.18879
- [11]
C. Li, J. Preskill, and Q. Xu, “Transversal dimension jump for product qLDPC codes”, (2026) arXiv:2510.07269
Page edit log
- Victor V. Albert (2026-09-26) — most recent
- Victor V. Albert (2026-09-23)
- Victor V. Albert (2026-09-22)
- Victor V. Albert (2026-08-19)
- Victor V. Albert (2026-07-29)
- Victor V. Albert (2026-07-18)
Cite as:
“Abelian two-block group-algebra code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/abelian_2bga, arXiv:2606.11484