Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2203.17216 · Symmetry

Distance Bounds for Generalized Bicycle Codes

Renyu Wang, Leonid P. Pryadko

Published Jun 30, 2022• 25 citations
arXivHTMLPDF

Abstract

Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ansätze, unrestricted GB codes may have linear distance scaling. In addition, low-density parity-check GB codes have a naturally overcomplete set of low-weight stabilizer generators, which is expected to improve their performance in the presence of syndrome measurement errors. For such GB codes with a given maximum generator weight w, we constructed upper distance bounds by mapping them to codes local in D≤w−1 dimensions, and lower existence bounds which give d≥O(n1/2). We have also conducted an exhaustive enumeration of GB codes for certain prime circulant sizes in a family of two-qubit encoding codes with row weights 4, 6, and 8; the observed distance scaling is consistent with A(w)n1/2+B(w), where n is the code length and A(w) is increasing with w.

DOI
10.3390/sym14071348

Related papers

Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Competitive Circuit-Level Performance

Reza Dastbasteh, Olatz Sanz Larrarte, Arun John Moncy +4 more

We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes that go beyond the capabilities of techniques based on classical codes. These bounds are shown to capture the true minimum distance for specific subclasses within the GB family. In particular, we demonstrate the existence of two highly degenerate GB code families with parameters $[\![d^2+1,2,d]\!]_2$ for odd $d \geq 3$ and $[\![d^2,2,d]\!]_2$ for even $d \geq 4$, both having qubit connectivity of four, similar to that of surface codes. For the odd-distance family, we analyze the structure of low-weight logical Pauli operators and establish the existence of a fault-tolerant logical CNOT gate between the two logical qubits, achievable via a simple relabeling of data qubits. Next, using nearly self-inverse polynomials, we extend our results to construct an infinite class of connectivity-six GB codes with an improved rate. For GB codes based on these polynomials, we further present a technique to realize transversal logical CNOT gates via data-qubit permutations. We further construct syndrome extraction schemes for our connectivity four GB families that avoid reductions in minimum distance due to circuit-level faults propagating from check qubits to data qubits. Finally, we numerically evaluate the logical error rate performance of the mentioned connectivity four families of GB codes under circuit-level noise, obtaining thresholds comparable to those of rotated surface codes.

arXiv:2508.09082•Aug 12, 2025•4 citations

Advancing Finite-Length Quantum Error Correction Using Generalized Bicycle Codes

Olai Å. Mostad, Hsuan-Yin Lin, Eirik Rosnes +2 more

Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code constructions have been proposed, their finite block-length performance often remains unquantified. In this work, we demonstrate that GB codes exhibit comparable or superior error correction performance in finite-length settings, particularly when designed with higher or unrestricted row weights. Leveraging their flexible construction, GB codes can be tailored to achieve high rates while maintaining efficient decoding. We evaluate GB codes against other leading quantum code families, such as quantum Tanner codes, single-parity-check product codes, and bivariate bicycle codes, highlighting their versatility in practical finite-length applications.

arXiv:2505.06157•International Symposium on Turbo Codes and Iterative Information Processing•Aug 18, 2025•2 citations

(2,2)-GB Codes: Classification and Comparison With Weight-4 Surface Codes

François Arnault, Philippe Gaborit, Nicolas Saussay

Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero elements per row. Leveraging a lower bound on their minimum distance, we construct three novel infinite families of optimal (2,2)-GB codes with parameters [[2n2, 2,n]], [[4r2, 2, 2r]], and [[(2t+1)2+1, 2, 2t+1]]. These families match the performance of Kitaev’s toric code and the best 2D weight-4 surface codes, reaching known theoretical limits. In particular, the second family breaks a long-held belief by providing optimal even-distance GB codes, previously deemed impossible. All are CSS codes derived from Cayley graphs. Recognizing that standard equivalence relations do not preserve their CSS structure, we introduce a CSS-preserving equivalence relation for rigorous comparison of Cayley graph-based CSS codes. Under this framework, the first two families are inequivalent to all previously known optimal weight-4 2D surface codes, while the third family is equivalent to the best-known odd-distance 2D surface code. Finally, we classify all extremal, non-equivalent (2, 2)-GB codes with length below 200 and present a comparison table with existing notable 2D weight-4 surface codes.

arXiv:2507.21237•IEEE Transactions on Information Theory•May 7, 2026•3 citations

Quantum Bicycle LDPC Codes with High $kd^2/n$ from Divisor-Driven Search

Liangdong Lu, Guanmin Guo, Yang Liu +1 more

Bicycle (two-block circulant) quantum low-density parity-check (LDPC) codes include some of the best known small quantum codes, yet their design has relied on group-algebra formulations in which the dimension and distance are accessible only through matrix computation. We show that in the cyclic case the construction collapses into the polynomial ring $\F_2[x]/(x^{l}-1)$: self-orthogonality is automatic, the quantum dimension is read off from a polynomial gcd, and the minimum distance is certified exactly through the Calderbank correspondence to additive codes over $\F_4$, turning code search into an algebraically pre-filtered enumeration that reaches parameter regimes poorly covered by existing tables. A computer search based on this framework recovers the short codes $[[42,12,4]]_2$ and $[[62,12,4]]_2$ and produces a family of codes with competitive figure of merit $kd^2/n$, including $[[66,20,7]]_2$ with $kd^2/n=14.85$, above the bivariate bicycle code $[[144,12,12]]_2$ ($kd^2/n=12$) at less than half the block length, together with $[[46,2,8]]_2$, $[[66,2,9]]_2$, $[[66,4,8]]_2$, $[[66,6,8]]_2$ and, at $n=90$, $[[90,16,6]]_2$, $[[90,18,6]]_2$, $[[90,20,6]]_2$. An exhaustive census at $n=48$ delineates the boundary of this picture: we exhibit a $[[48,10,6]]_2$ code from a minimal $48$-element group (the Aydin--Tamo--Barg realization uses $72$ elements), and prove that distance $5$ forces a stabilizer-rank loss, which excludes $[[48,10,5]]_2$ from the weight-$8$ symmetric coset family. The framework thus opens a systematic route to bicycle-type quantum LDPC codes beyond the reach of group-theoretic searches, and identifies exactly where genuinely coset-theoretic phenomena begin.

cs.ITCross-listedarXiv:2608.09115•Aug 11, 2026•2 citations

Univariate Bicycle Quantum LDPC Codes: Explicit Logical Structure and Distance Bounds

Sheida Rabeti, Hessam Mahdavifar

We introduce univariate bicycle (UB) codes, a structured subclass of generalized bicycle (GB) quantum low-density parity-check (LDPC) codes obtained via a Frobenius relation. This construction reduces the code design space from a two-polynomial search in GB codes to a single-polynomial search, while preserving sparsity. We provide an explicit algebraic characterization of the logical coset spaces by constructing a basis for the logical quotient space, yielding a complete parametrization of logical operators. Leveraging this structure, we derive upper bounds on the minimum distance by relating structured logical representatives to cycle-density properties of associated circulant matrices. Finally, simulation results for short- to medium-length UB codes (block lengths ranging from a few hundred to approximately $10^3$) demonstrate competitive performance relative to existing GB and bivariate bicycle (BB) codes despite the additional algebraic restriction.

arXiv:2605.14173•May 13, 2026•7 citations

Edge-Based Anisotropic Decoding for Generalized Bicycle Codes

Dimitris Chytas, Paul N. Fessatidis, Boulat A. Bash +1 more

Quantum low-density parity-check (QLDPC) codes provide non vanishing rates, distance scaling with the blocklength of the code, and facilitate fast iterative decoding because of their sparsity. However, in practice iterative decoding fails to exploit the distance of the code, because it cannot resolve the symmetries imposed by degeneracy. In this work, we provide a graph theoretic characterization of degeneracy for the family of generalized bicycle (GB) codes. This viewpoint shows that harmful degenerate error patterns persist whenever they remain related by automorphisms preserved by the decoder. Motivated by symmetry breaking via graph coloring, we compare three coloring approaches: no coloring, block-coloring, and edge-coloring. For GB codes, we show that edge-coloring can eliminate all automorphisms in low-weight stabilizer-induced subgraphs. We practically realize the coloring schemes as isotropic, block- anisotropic and edge-anisotropic min-sum (MS) decoding. Experimental results show that edge anisotropic min-sum decoding obtains improved performance over isotropic and block anisotropic decoding for several GB codes in a small number of iterations.

quant-pharXiv:2605.03218•May 6, 2026•2 citations
Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ansätze, unrestricted GB codes may have linear distance scaling. In addition, low-density parity-check GB codes have a naturally overcomplete set of low-weight stabilizer generators, which is expected to improve their performance in the presence of syndrome measurement errors. For such GB codes with a given maximum generator weight w, we constructed upper distance bounds by mapping them to codes local in D≤w−1 dimensions, and lower existence bounds which give d≥O(n1/2). We have also conducted an exhaustive enumeration of GB codes for certain prime circulant sizes in a family of two-qubit encoding codes with row weights 4, 6, and 8; the observed distance scaling is consistent with A(w)n1/2+B(w), where n is the code length and A(w) is increasing with w.
We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes that go beyond the capabilities of techniques based on classical codes. These bounds are shown to capture the true minimum distance for specific subclasses within the GB family. In particular, we demonstrate the existence of two highly degenerate GB code families with parameters [ ⁣[d2+1,2,d] ⁣]2[\![d^2+1,2,d]\!]_2[[d2+1,2,d]]2​ for odd d≥3d \geq 3d≥3 and [ ⁣[d2,2,d] ⁣]2[\![d^2,2,d]\!]_2[[d2,2,d]]2​ for even d≥4d \geq 4d≥4, both having qubit connectivity of four, similar to that of surface codes. For the odd-distance family, we analyze the structure of low-weight logical Pauli operators and establish the existence of a fault-tolerant logical CNOT gate between the two logical qubits, achievable via a simple relabeling of data qubits. Next, using nearly self-inverse polynomials, we extend our results to construct an infinite class of connectivity-six GB codes with an improved rate. For GB codes based on these polynomials, we further present a technique to realize transversal logical CNOT gates via data-qubit permutations. We further construct syndrome extraction schemes for our connectivity four GB families that avoid reductions in minimum distance due to circuit-level faults propagating from check qubits to data qubits. Finally, we numerically evaluate the logical error rate performance of the mentioned connectivity four families of GB codes under circuit-level noise, obtaining thresholds comparable to those of rotated surface codes.
Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code constructions have been proposed, their finite block-length performance often remains unquantified. In this work, we demonstrate that GB codes exhibit comparable or superior error correction performance in finite-length settings, particularly when designed with higher or unrestricted row weights. Leveraging their flexible construction, GB codes can be tailored to achieve high rates while maintaining efficient decoding. We evaluate GB codes against other leading quantum code families, such as quantum Tanner codes, single-parity-check product codes, and bivariate bicycle codes, highlighting their versatility in practical finite-length applications.
Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero elements per row. Leveraging a lower bound on their minimum distance, we construct three novel infinite families of optimal (2,2)-GB codes with parameters [[2n2, 2,n]], [[4r2, 2, 2r]], and [[(2t+1)2+1, 2, 2t+1]]. These families match the performance of Kitaev’s toric code and the best 2D weight-4 surface codes, reaching known theoretical limits. In particular, the second family breaks a long-held belief by providing optimal even-distance GB codes, previously deemed impossible. All are CSS codes derived from Cayley graphs. Recognizing that standard equivalence relations do not preserve their CSS structure, we introduce a CSS-preserving equivalence relation for rigorous comparison of Cayley graph-based CSS codes. Under this framework, the first two families are inequivalent to all previously known optimal weight-4 2D surface codes, while the third family is equivalent to the best-known odd-distance 2D surface code. Finally, we classify all extremal, non-equivalent (2, 2)-GB codes with length below 200 and present a comparison table with existing notable 2D weight-4 surface codes.
Quantum Bicycle LDPC Codes with High kd2/nkd^2/nkd2/n from Divisor-Driven Search
Bicycle (two-block circulant) quantum low-density parity-check (LDPC) codes include some of the best known small quantum codes, yet their design has relied on group-algebra formulations in which the dimension and distance are accessible only through matrix computation. We show that in the cyclic case the construction collapses into the polynomial ring $\F_2[x]/(x^{l}-1)$: self-orthogonality is automatic, the quantum dimension is read off from a polynomial gcd, and the minimum distance is certified exactly through the Calderbank correspondence to additive codes over $\F_4$, turning code search into an algebraically pre-filtered enumeration that reaches parameter regimes poorly covered by existing tables. A computer search based on this framework recovers the short codes [[42,12,4]]2[[42,12,4]]_2[[42,12,4]]2​ and [[62,12,4]]2[[62,12,4]]_2[[62,12,4]]2​ and produces a family of codes with competitive figure of merit kd2/nkd^2/nkd2/n, including [[66,20,7]]2[[66,20,7]]_2[[66,20,7]]2​ with kd2/n=14.85kd^2/n=14.85kd2/n=14.85, above the bivariate bicycle code [[144,12,12]]2[[144,12,12]]_2[[144,12,12]]2​ (kd2/n=12kd^2/n=12kd2/n=12) at less than half the block length, together with [[46,2,8]]2[[46,2,8]]_2[[46,2,8]]2​, [[66,2,9]]2[[66,2,9]]_2[[66,2,9]]2​, [[66,4,8]]2[[66,4,8]]_2[[66,4,8]]2​, [[66,6,8]]2[[66,6,8]]_2[[66,6,8]]2​ and, at n=90n=90n=90, [[90,16,6]]2[[90,16,6]]_2[[90,16,6]]2​, [[90,18,6]]2[[90,18,6]]_2[[90,18,6]]2​, [[90,20,6]]2[[90,20,6]]_2[[90,20,6]]2​. An exhaustive census at n=48n=48n=48 delineates the boundary of this picture: we exhibit a [[48,10,6]]2[[48,10,6]]_2[[48,10,6]]2​ code from a minimal 484848-element group (the Aydin--Tamo--Barg realization uses 727272 elements), and prove that distance 555 forces a stabilizer-rank loss, which excludes [[48,10,5]]2[[48,10,5]]_2[[48,10,5]]2​ from the weight-888 symmetric coset family. The framework thus opens a systematic route to bicycle-type quantum LDPC codes beyond the reach of group-theoretic searches, and identifies exactly where genuinely coset-theoretic phenomena begin.
We introduce univariate bicycle (UB) codes, a structured subclass of generalized bicycle (GB) quantum low-density parity-check (LDPC) codes obtained via a Frobenius relation. This construction reduces the code design space from a two-polynomial search in GB codes to a single-polynomial search, while preserving sparsity. We provide an explicit algebraic characterization of the logical coset spaces by constructing a basis for the logical quotient space, yielding a complete parametrization of logical operators. Leveraging this structure, we derive upper bounds on the minimum distance by relating structured logical representatives to cycle-density properties of associated circulant matrices. Finally, simulation results for short- to medium-length UB codes (block lengths ranging from a few hundred to approximately 10310^3103) demonstrate competitive performance relative to existing GB and bivariate bicycle (BB) codes despite the additional algebraic restriction.
Quantum low-density parity-check (QLDPC) codes provide non vanishing rates, distance scaling with the blocklength of the code, and facilitate fast iterative decoding because of their sparsity. However, in practice iterative decoding fails to exploit the distance of the code, because it cannot resolve the symmetries imposed by degeneracy. In this work, we provide a graph theoretic characterization of degeneracy for the family of generalized bicycle (GB) codes. This viewpoint shows that harmful degenerate error patterns persist whenever they remain related by automorphisms preserved by the decoder. Motivated by symmetry breaking via graph coloring, we compare three coloring approaches: no coloring, block-coloring, and edge-coloring. For GB codes, we show that edge-coloring can eliminate all automorphisms in low-weight stabilizer-induced subgraphs. We practically realize the coloring schemes as isotropic, block- anisotropic and edge-anisotropic min-sum (MS) decoding. Experimental results show that edge anisotropic min-sum decoding obtains improved performance over isotropic and block anisotropic decoding for several GB codes in a small number of iterations.