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:2508.09082

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

Reza Dastbasteh, Olatz Sanz Larrarte, Arun John Moncy, Paul Schnabl, Pedro M. Crespo, Josu Etxezarreta Martinez, R. M. Otxoa

Published Aug 12, 2025• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2508.09082

Related papers

Distance Bounds for Generalized Bicycle Codes

Renyu Wang, Leonid P. Pryadko

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.

arXiv:2203.17216•Symmetry•Jun 30, 2022•25 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

Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure

AJ Davenport, John Blue, Isaac Chuang

Automorphisms of quantum codes, when they exist, offer a pathway toward fault-tolerant gate implementation via qubit relabeling. Although useful, the conditions under which automorphisms appear in a given code remain poorly understood. In this paper, we develop an algebraic framework for systematically analyzing and engineering automorphisms in Generalized Bicycle (GB) codes. Central to our approach is the derivation of a three-space dependency between the polynomial ring space, the parity check matrix space, and the $\mathbb{F}_2^{2\ell}$ qubit space, similar to the structure found in the study of classical cyclic codes. By expressing GB codes as a pair of cyclic submodules of $R_\ell^2$, where $R_\ell \cong \mathbb{F}_2[x]/\langle x^\ell-1\rangle$, we reduce the search for code automorphisms to a deterministic algebraic problem, deriving necessary and sufficient conditions for the existence of block-separable automorphisms built from cyclic shifts, ring automorphisms and block-swaps. We connect these conditions to the fold-transversal gate framework, providing explicit criteria for the existence of $H$-, $S$-, and $CX$-type fold-transversal gates. We further discuss structured bases for logical operators in order to determine the logical action of a given automorphism. Finally, we introduce the Maximal Cube Root (MCR) code family, a family of GB codes constructed around the principle of maximizing automorphism flexibility and fold-CX gates. We demonstrate a collection of $k=2$ MCR codes up to $d=13$ generating the 2-qubit Clifford group via automorphism and fold-transversal gates, with stabilizer weight ranging from 8 to 16, and $k>2$ MCR codes with a minimum of 20 distinct logical gates achievable from automorphisms. This serves as a first demonstration of inverse design: using these methods to build codes around a rich automorphism structure from the ground up.

quant-pharXiv:2606.05044•Jun 4, 2026•7 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

Louvre: Relaxing Hardware Requirements of Quantum LDPC Codes by Routing with Expanded Quantum Instruction Set

Runshi Zhou, Zhang Fang, Hui‐Hai Zhao +3 more

Abstract Generalized bicycle codes (GB codes) represent a promising family of quantum low-density parity-check codes, characterized by high code rates and relatively local qubit connectivity. A subclass of the GB code called bivariate bicycle codes (BB codes) has garnered significant interest due to its compatibility with two-layer connectivity architectures on superconducting quantum processors. However, one key limitation of BB codes is the high qubit connectivity degree requirements (degree 6), which exacerbates the noise susceptibility of the system. Building on the recent progress in implementing multiple two-qubit gates on a single chip, this work introduces Louvre—a routing-based framework designed to reduce qubit connectivity requirements in GB codes. Specifically, Louvre-7 achieves degree reduction while preserving the depth of the syndrome extraction circuit, whereas Louvre-8 further minimizes the connectivity by slightly increasing the circuit depth. When applied to BB codes, these two schemes could reduce the average degree to 4.5 and 4, respectively. Crucially, Louvre eliminates some of the long-range, error-prone connections, which is a distinct advantage over prior approaches. Numerical simulations demonstrate that Louvre-7 has an logical error rate indistinguishable from that of the standard syndrome extraction circuits of GB codes, while Louvre-8 only incurs a slight error rate penalty.

arXiv:2508.20858•npj Quantum Information•Jun 17, 2026•9 citations

Mirror codes: High-threshold quantum LDPC codes beyond the CSS regime

Andrey Boris Khesin, Jonathan Z. Lu

The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group $G$ and two subsets of $G$ whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find $[[ 60, 4, 10 ]], [[ 36, 6, 6 ]], [[ 48, 8, 6 ]]$, and $[[ 85, 8, 9 ]]$ codes, all of which are not CSS; we also find several weight-7 codes with $kd > n$. Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of $0.2\%$, approximately matching that of the $[[ 144, 12, 12 ]]$ BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.

quant-pharXiv:2603.05496•Mar 6, 2026•9 citations
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 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.
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.
Automorphisms of quantum codes, when they exist, offer a pathway toward fault-tolerant gate implementation via qubit relabeling. Although useful, the conditions under which automorphisms appear in a given code remain poorly understood. In this paper, we develop an algebraic framework for systematically analyzing and engineering automorphisms in Generalized Bicycle (GB) codes. Central to our approach is the derivation of a three-space dependency between the polynomial ring space, the parity check matrix space, and the F22ℓ\mathbb{F}_2^{2\ell}F22ℓ​ qubit space, similar to the structure found in the study of classical cyclic codes. By expressing GB codes as a pair of cyclic submodules of Rℓ2R_\ell^2Rℓ2​, where Rℓ≅F2[x]/⟨xℓ−1⟩R_\ell \cong \mathbb{F}_2[x]/\langle x^\ell-1\rangleRℓ​≅F2​[x]/⟨xℓ−1⟩, we reduce the search for code automorphisms to a deterministic algebraic problem, deriving necessary and sufficient conditions for the existence of block-separable automorphisms built from cyclic shifts, ring automorphisms and block-swaps. We connect these conditions to the fold-transversal gate framework, providing explicit criteria for the existence of HHH-, SSS-, and CXCXCX-type fold-transversal gates. We further discuss structured bases for logical operators in order to determine the logical action of a given automorphism. Finally, we introduce the Maximal Cube Root (MCR) code family, a family of GB codes constructed around the principle of maximizing automorphism flexibility and fold-CX gates. We demonstrate a collection of k=2k=2k=2 MCR codes up to d=13d=13d=13 generating the 2-qubit Clifford group via automorphism and fold-transversal gates, with stabilizer weight ranging from 8 to 16, and k>2k>2k>2 MCR codes with a minimum of 20 distinct logical gates achievable from automorphisms. This serves as a first demonstration of inverse design: using these methods to build codes around a rich automorphism structure from the ground up.
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.
Abstract Generalized bicycle codes (GB codes) represent a promising family of quantum low-density parity-check codes, characterized by high code rates and relatively local qubit connectivity. A subclass of the GB code called bivariate bicycle codes (BB codes) has garnered significant interest due to its compatibility with two-layer connectivity architectures on superconducting quantum processors. However, one key limitation of BB codes is the high qubit connectivity degree requirements (degree 6), which exacerbates the noise susceptibility of the system. Building on the recent progress in implementing multiple two-qubit gates on a single chip, this work introduces Louvre—a routing-based framework designed to reduce qubit connectivity requirements in GB codes. Specifically, Louvre-7 achieves degree reduction while preserving the depth of the syndrome extraction circuit, whereas Louvre-8 further minimizes the connectivity by slightly increasing the circuit depth. When applied to BB codes, these two schemes could reduce the average degree to 4.5 and 4, respectively. Crucially, Louvre eliminates some of the long-range, error-prone connections, which is a distinct advantage over prior approaches. Numerical simulations demonstrate that Louvre-7 has an logical error rate indistinguishable from that of the standard syndrome extraction circuits of GB codes, while Louvre-8 only incurs a slight error rate penalty.
The realization of quantum error correction protocols whose logical error rates are suppressed far below physical error rates relies on an intricate combination: the error-correcting code's efficiency, the syndrome extraction circuit's fault tolerance and overhead, the decoder's quality, and the device's constraints, such as physical qubit count and connectivity. This work makes two contributions towards error-corrected quantum devices. First, we introduce mirror codes, a simple yet flexible construction of LDPC stabilizer codes parameterized by a group GGG and two subsets of GGG whose total size bounds the check weight. These codes contain all abelian two-block group algebra codes, such as bivariate bicycle (BB) codes. At the same time, they are manifestly not CSS in general, thus deviating substantially from most prior constructions. Fixing a check weight of 6, we find [[60,4,10]],[[36,6,6]],[[48,8,6]][[ 60, 4, 10 ]], [[ 36, 6, 6 ]], [[ 48, 8, 6 ]][[60,4,10]],[[36,6,6]],[[48,8,6]], and [[85,8,9]][[ 85, 8, 9 ]][[85,8,9]] codes, all of which are not CSS; we also find several weight-7 codes with kd>nkd > nkd>n. Next, we construct syndrome extraction circuits that trade overhead for provable fault tolerance. These circuits use 1-2, 3, and 6 ancillae per check, and respectively are partially fault-tolerant (FT), provably FT on weight-6 CSS codes, and provably FT on \emph{all} weight-6 stabilizer codes. Using our constructions, we perform end-to-end quantum memory experiments on several representative mirror codes under circuit-level noise. We achieve an error pseudothreshold on the order of 0.2%0.2\%0.2%, approximately matching that of the [[144,12,12]][[ 144, 12, 12 ]][[144,12,12]] BB code under the same model. These findings position mirror codes as a versatile candidate for fault-tolerant quantum memory, especially on smaller-scale devices in the near term.