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:2601.01137 · IEEE International Symposium on Information Theory (ISIT)

Single-Shot and Few-Shot Decoding via Stabilizer Redundancy in Bivariate Bicycle Codes

Mohammad Rowshan

cs.ITquant-phSubmitted Jan 3, 2026• Announced Jan 6, 2026• 2 citations
arXivHTMLPDF

Abstract

Bivariate bicycle (BB) codes are a prominent class of quantum LDPC codes constructed from group algebras. While the logical dimension and quantum distance of \emph{coprime} BB codes are known to be determined by a greatest common divisor polynomial $g(z)$, the properties governing their fault tolerance under noisy measurement have remained implicit. In this work, we prove that this same polynomial $g(z)$ dictates the code's stabilizer redundancy and the structure of the classical \emph{syndrome codes} required for single-shot decoding. We derive a strict equality between the quantum rate and the stabilizer redundancy density, and we provide BCH-like bounds on the achievable single-shot measurement error tolerance. Guided by this framework, we construct small coprime BB codes with significantly improved syndrome distance ($d_S$) and evaluate them using BP+OSD. Our analysis reveals a structural bottleneck: within the coprime BB ansatz, high quantum rate imposes an upper bound on syndrome distance, limiting single-shot performance. These results provide concrete algebraic design rules for next-generation 2BGA codes in measurement-limited architectures.

Comments
6 pages, 5 theorems, 5 figures

Related papers

Single-shot and two-shot decoding with generalized bicycle codes

Hsiang-Ku Lin, Liu, Xingrui, Pak Kau Lim +1 more

Generalized-bicycle (GB) and more general two-block group-algebra (2BGA) quantum error-correcting codes have naturally redundant minimum-weight stabilizer generators. To use this redundancy, we constructed a large number of ``planar'' 2BGA codes over abelian groups with one and two generators, with each block row of weight 3, relatively large dimensions, distances, and maximum syndrome distance $d_{\rm S}=3$. We simulated the performance of three such codes under phenomenological noise and standard circuit noise, using sliding window sequential decoding protocol covering $T\ge 1$ measurement rounds at a time, based on an in-house binary BP+OSD decoder. While true single-shot decoding ($T=1$) suffers from a significant loss of accuracy, already two-shot ($T=2$) decoding gives nearly the same logical error rates as multi-shot with much larger $T$. Comparison with the same codes but additional stabilizer generators dropped shows that redundancy significantly improves decoding accuracy for all $T\ge 1$.

arXiv:2502.19406•Feb 26, 2025•21 citations

Metachecks in Bivariate Bicycle Codes: Syndrome Distance, Measurement Faults, and Repair Limits

Mohammad Rowshan

Faulty syndrome measurements can corrupt an otherwise correct quantum-error correction step. Bivariate bicycle (BB) codes contain dependent stabilizer checks, so every valid syndrome obeys additional parity constraints, or metachecks. We study how far this built-in redundancy can identify measurement faults and when the remaining ambiguity is unavoidable, while separately checking the code's logical structure. A logical decomposition is used as a preliminary safety check: it identifies a $k/2$-dimensional annihilator subspace and a $k/2$-dimensional colon quotient, and the minimum-weight logical need not be visible from the annihilator side alone. On the measurement side, translation symmetry partitions syndrome locations into classes that carry identical metacheck information. This gives an exact characterization of the leading single-fault ambiguity, a bound on how many fault locations can be distinguished, and a family-level repair limit when the encoded dimension stays bounded while the block length grows. Under a static-data assumption, the same calculation gives the minimum number of checks that must be remeasured to remove every single-fault ambiguity. Exact finite-code calculations illustrate both regimes: all single measurement faults are distinguishable in a 72-qubit BB code, whereas the 144-qubit Gross code merges its 72 syndrome locations into 36 indistinguishable pairs. In a 108-qubit example, one logical component first appears at weight 12 while the other contains a weight-10 logical. Sustained phenomenological experiments show that joint data--measurement decoding is more robust than a separated repair stage on the more ambiguous codes. The resulting tests apply to general two-block BB codes, including non-coprime periods and repeated-root cases.

quant-pharXiv:2609.39121•Oct 1, 2026•0 citations

Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes

Mohammad Rowshan, Simon Devitt

Bivariate bicycle (BB) quantum codes are a prominent finite-length family of quantum low-density parity-check codes, but their minimum distance is usually established numerically rather than read from the defining polynomials. We study the $Z$-logical quotient $K/S$ over $\mathbb F_2[x,y]/(x^\ell-1,y^m-1)$ and show that it fits into a short exact sequence with an annihilator quotient as kernel and a colon quotient as cokernel. The sequence gives an explicit logical basis, a dimension formula, and a componentwise distance identity $d_Z=\min(d_{\mathcal A},d_{\mathcal C})$. Using the Frobenius structure of the finite group algebra, we prove $r_{\mathcal A}=r_{\mathcal C}=k/2$ for every BB code, including repeated-root cases. The algebraic component of a logical class is distinct from the support shape of its lightest representatives: an annihilator class can have a lighter two-block representative, and a colon class can have a one-sided minimum. For lower bounds we show that every proper subset of a minimum-weight logical operator has nonzero syndrome, and that this property persists inside the colon component but not inside the annihilator component. A translation-anchored cluster search built on it proves the distances $4,6,10,10,12,18$ of the six standard BB codes of lengths $18$ to $288$ and enumerates every minimum-weight logical operator. The resulting census shows that $[[108,8,10]]$ is the only one of the six whose distance is attained in a single component, with $d_{\mathcal C}=10$ and $d_{\mathcal A}=12$.

quant-pharXiv:2609.39395•Oct 1, 2026•2 citations

Distributed Quantum Error Correction with Bivariate Bicycle Codes in a Modular Architecture

Nitish Kumar Chandra, Eneet Kaur, Reza Nejabati +1 more

Quantum low density parity check (qLDPC) codes, particularly bivariate bicycle (BB) codes, achieve competitive fault tolerance thresholds while offering substantially higher encoding rates than planar surface codes. However, their intrinsically long-range stabilizer structure makes them difficult to implement on monolithic devices with nearest neighbor connectivity and limited qubit capacity. In this work, we study the realization of a BB code in a modular multiprocessor architecture, where quantum processors are interconnected through shared Bell pairs. We consider processors with all to all internal connectivity, which is feasible on trapped ion and neutral atom platforms, enabling flexible local gate execution while inter-processor (nonlocal) gates are mediated by shared entanglement. We describe a star network architecture that can realize this distributed setting. We partition the qubits of the [[144,12,12]] BB code across 4, 6, and 12 quantum processors and analyze the resulting logical error rates and pseudo-threshold performance under circuit level noise by varying the number of processors and a scaling factor that captures the additional noise associated with nonlocal operations. We use Monte Carlo simulations with BP+OSD decoding and extend the previously known BB code ansatz to the distributed setting. Our results provide architectural insight and design considerations for distributed BB codes in modular quantum computing architectures.

quant-pharXiv:2605.04663•May 7, 2026•7 citations

Quantum bivariate bicycle codes with weight-8 checks surpassing the BB benchmark

Liangdong Lu, Ruipan Yang, Guanmin Guo

Bivariate bicycle (BB) codes of Bravyi \emph{et al.}~\cite{Bravyi2024} are quantum low-density parity-check codes with weight-$6$ checks, exemplified by $[[144,12,12]]$ with $kd^2/n=12$. We develop the algebraic structure theory of BB-type codes with weight-$8$ checks (weight-$4$ generator polynomials) and use it, together with an exactly validated search pipeline, to construct and certify new codes. We prove an exact dimension formula $k=2\dim R/(A,B)$ (forcing even $k$), a $4\ell m$-element symmetry group on generator pairs, an $X/Z$ distance equality $d_X=d_Z$, and a family of subgroup-coset kernel vectors giving rigorous distance upper bounds and a design rule for high-distance constructions; all distances are computed exhaustively by a cross-validated bit-mask verifier. At $n=144$ the pipeline returns a census of $53$ codes whose strongest members surpass the BB benchmark: $[[144,6,d\ge 15]]$ exceeds the benchmark distance $12$ (certified $d\ge 15$), $[[144,10,12]]$ reaches it with weight-$8$ checks, and $[[144,16,10]]$ encodes a third more logical qubits at $kd^2/n=11.11$ ($7.4\%$ below benchmark) while decoding no worse. At $n=72$, $[[72,14,8]]$ attains $kd^2/n=12.44$---more than twice the same-length BB code---and decodes better; a circuit-level memory experiment places our weight-$8$ codes at $\approx 0.1\%$ pseudo-threshold versus $\approx 0.4\%$ for the BB reference under an identical model, quantifying the threshold cost of the heavier checks. All structural statements are verified numerically on the whole census.

quant-pharXiv:2609.06572•Sep 8, 2026•4 citations

Coprime Bivariate Bicycle Codes and Their Layouts on Cold Atoms

Ming Wang, Frank Mueller

Quantum computing is deemed to require error correction at scale to mitigate physical noise by reducing it to lower noise levels while operating on encoded logical qubits. Popular quantum error correction schemes include CSS code, of which surface codes provide regular mappings onto 2D planes suitable for contemporary quantum devices together with known transversal logical gates. Recently, qLDPC codes have been proposed as a means to provide denser encoding with the class of bivariate bicycle (BB) codes promising feasible design for devices.This work contributes a novel subclass of BB codes suitable for quantum error correction. This subclass employs c o p r i m e s and the product x y of the two generating variables x and y to construct polynomials, rather than using x and y separately as in vanilla BB codes. In contrast to vanilla BB codes, where parameters remain unknown prior to code discovery, the rate of the proposed code can be determined beforehand by specifying a factor polynomial as an input to the numerical search algorithm. Using this coprime-BB construction, we found a number of surprisingly short to medium-length codes that were previously unknown. We also propose a layout on cold atom arrays tailored for coprime-BB codes. The proposed layout reduces both move time for short to medium-length codes and the number of moves of atoms to perform syndrome extractions. We consider an error model with global laser noise on cold atoms, and simulations show that our proposed layout achieves significant improvements over prior work across the simulated codes.

arXiv:2408.10001•Quantum•Feb 23, 2026•36 citations
Bivariate bicycle (BB) codes are a prominent class of quantum LDPC codes constructed from group algebras. While the logical dimension and quantum distance of \emph{coprime} BB codes are known to be determined by a greatest common divisor polynomial g(z)g(z)g(z), the properties governing their fault tolerance under noisy measurement have remained implicit. In this work, we prove that this same polynomial g(z)g(z)g(z) dictates the code's stabilizer redundancy and the structure of the classical \emph{syndrome codes} required for single-shot decoding. We derive a strict equality between the quantum rate and the stabilizer redundancy density, and we provide BCH-like bounds on the achievable single-shot measurement error tolerance. Guided by this framework, we construct small coprime BB codes with significantly improved syndrome distance (dSd_SdS​) and evaluate them using BP+OSD. Our analysis reveals a structural bottleneck: within the coprime BB ansatz, high quantum rate imposes an upper bound on syndrome distance, limiting single-shot performance. These results provide concrete algebraic design rules for next-generation 2BGA codes in measurement-limited architectures.
Generalized-bicycle (GB) and more general two-block group-algebra (2BGA) quantum error-correcting codes have naturally redundant minimum-weight stabilizer generators. To use this redundancy, we constructed a large number of ``planar'' 2BGA codes over abelian groups with one and two generators, with each block row of weight 3, relatively large dimensions, distances, and maximum syndrome distance dS=3d_{\rm S}=3dS​=3. We simulated the performance of three such codes under phenomenological noise and standard circuit noise, using sliding window sequential decoding protocol covering T≥1T\ge 1T≥1 measurement rounds at a time, based on an in-house binary BP+OSD decoder. While true single-shot decoding (T=1T=1T=1) suffers from a significant loss of accuracy, already two-shot (T=2T=2T=2) decoding gives nearly the same logical error rates as multi-shot with much larger TTT. Comparison with the same codes but additional stabilizer generators dropped shows that redundancy significantly improves decoding accuracy for all T≥1T\ge 1T≥1.
Faulty syndrome measurements can corrupt an otherwise correct quantum-error correction step. Bivariate bicycle (BB) codes contain dependent stabilizer checks, so every valid syndrome obeys additional parity constraints, or metachecks. We study how far this built-in redundancy can identify measurement faults and when the remaining ambiguity is unavoidable, while separately checking the code's logical structure. A logical decomposition is used as a preliminary safety check: it identifies a k/2k/2k/2-dimensional annihilator subspace and a k/2k/2k/2-dimensional colon quotient, and the minimum-weight logical need not be visible from the annihilator side alone. On the measurement side, translation symmetry partitions syndrome locations into classes that carry identical metacheck information. This gives an exact characterization of the leading single-fault ambiguity, a bound on how many fault locations can be distinguished, and a family-level repair limit when the encoded dimension stays bounded while the block length grows. Under a static-data assumption, the same calculation gives the minimum number of checks that must be remeasured to remove every single-fault ambiguity. Exact finite-code calculations illustrate both regimes: all single measurement faults are distinguishable in a 72-qubit BB code, whereas the 144-qubit Gross code merges its 72 syndrome locations into 36 indistinguishable pairs. In a 108-qubit example, one logical component first appears at weight 12 while the other contains a weight-10 logical. Sustained phenomenological experiments show that joint data--measurement decoding is more robust than a separated repair stage on the more ambiguous codes. The resulting tests apply to general two-block BB codes, including non-coprime periods and repeated-root cases.
Bivariate bicycle (BB) quantum codes are a prominent finite-length family of quantum low-density parity-check codes, but their minimum distance is usually established numerically rather than read from the defining polynomials. We study the ZZZ-logical quotient K/SK/SK/S over F2[x,y]/(xℓ−1,ym−1)\mathbb F_2[x,y]/(x^\ell-1,y^m-1)F2​[x,y]/(xℓ−1,ym−1) and show that it fits into a short exact sequence with an annihilator quotient as kernel and a colon quotient as cokernel. The sequence gives an explicit logical basis, a dimension formula, and a componentwise distance identity dZ=min⁡(dA,dC)d_Z=\min(d_{\mathcal A},d_{\mathcal C})dZ​=min(dA​,dC​). Using the Frobenius structure of the finite group algebra, we prove rA=rC=k/2r_{\mathcal A}=r_{\mathcal C}=k/2rA​=rC​=k/2 for every BB code, including repeated-root cases. The algebraic component of a logical class is distinct from the support shape of its lightest representatives: an annihilator class can have a lighter two-block representative, and a colon class can have a one-sided minimum. For lower bounds we show that every proper subset of a minimum-weight logical operator has nonzero syndrome, and that this property persists inside the colon component but not inside the annihilator component. A translation-anchored cluster search built on it proves the distances 4,6,10,10,12,184,6,10,10,12,184,6,10,10,12,18 of the six standard BB codes of lengths 181818 to 288288288 and enumerates every minimum-weight logical operator. The resulting census shows that [[108,8,10]][[108,8,10]][[108,8,10]] is the only one of the six whose distance is attained in a single component, with dC=10d_{\mathcal C}=10dC​=10 and dA=12d_{\mathcal A}=12dA​=12.
Quantum low density parity check (qLDPC) codes, particularly bivariate bicycle (BB) codes, achieve competitive fault tolerance thresholds while offering substantially higher encoding rates than planar surface codes. However, their intrinsically long-range stabilizer structure makes them difficult to implement on monolithic devices with nearest neighbor connectivity and limited qubit capacity. In this work, we study the realization of a BB code in a modular multiprocessor architecture, where quantum processors are interconnected through shared Bell pairs. We consider processors with all to all internal connectivity, which is feasible on trapped ion and neutral atom platforms, enabling flexible local gate execution while inter-processor (nonlocal) gates are mediated by shared entanglement. We describe a star network architecture that can realize this distributed setting. We partition the qubits of the [[144,12,12]] BB code across 4, 6, and 12 quantum processors and analyze the resulting logical error rates and pseudo-threshold performance under circuit level noise by varying the number of processors and a scaling factor that captures the additional noise associated with nonlocal operations. We use Monte Carlo simulations with BP+OSD decoding and extend the previously known BB code ansatz to the distributed setting. Our results provide architectural insight and design considerations for distributed BB codes in modular quantum computing architectures.
Bivariate bicycle (BB) codes of Bravyi \emph{et al.}~\cite{Bravyi2024} are quantum low-density parity-check codes with weight-666 checks, exemplified by [[144,12,12]][[144,12,12]][[144,12,12]] with kd2/n=12kd^2/n=12kd2/n=12. We develop the algebraic structure theory of BB-type codes with weight-888 checks (weight-444 generator polynomials) and use it, together with an exactly validated search pipeline, to construct and certify new codes. We prove an exact dimension formula k=2dim⁡R/(A,B)k=2\dim R/(A,B)k=2dimR/(A,B) (forcing even kkk), a 4ℓm4\ell m4ℓm-element symmetry group on generator pairs, an X/ZX/ZX/Z distance equality dX=dZd_X=d_ZdX​=dZ​, and a family of subgroup-coset kernel vectors giving rigorous distance upper bounds and a design rule for high-distance constructions; all distances are computed exhaustively by a cross-validated bit-mask verifier. At n=144n=144n=144 the pipeline returns a census of 535353 codes whose strongest members surpass the BB benchmark: [[144,6,d≥15]][[144,6,d\ge 15]][[144,6,d≥15]] exceeds the benchmark distance 121212 (certified d≥15d\ge 15d≥15), [[144,10,12]][[144,10,12]][[144,10,12]] reaches it with weight-888 checks, and [[144,16,10]][[144,16,10]][[144,16,10]] encodes a third more logical qubits at kd2/n=11.11kd^2/n=11.11kd2/n=11.11 (7.4%7.4\%7.4% below benchmark) while decoding no worse. At n=72n=72n=72, [[72,14,8]][[72,14,8]][[72,14,8]] attains kd2/n=12.44kd^2/n=12.44kd2/n=12.44---more than twice the same-length BB code---and decodes better; a circuit-level memory experiment places our weight-888 codes at ≈0.1%\approx 0.1\%≈0.1% pseudo-threshold versus ≈0.4%\approx 0.4\%≈0.4% for the BB reference under an identical model, quantifying the threshold cost of the heavier checks. All structural statements are verified numerically on the whole census.
Quantum computing is deemed to require error correction at scale to mitigate physical noise by reducing it to lower noise levels while operating on encoded logical qubits. Popular quantum error correction schemes include CSS code, of which surface codes provide regular mappings onto 2D planes suitable for contemporary quantum devices together with known transversal logical gates. Recently, qLDPC codes have been proposed as a means to provide denser encoding with the class of bivariate bicycle (BB) codes promising feasible design for devices.This work contributes a novel subclass of BB codes suitable for quantum error correction. This subclass employs c o p r i m e s and the product x y of the two generating variables x and y to construct polynomials, rather than using x and y separately as in vanilla BB codes. In contrast to vanilla BB codes, where parameters remain unknown prior to code discovery, the rate of the proposed code can be determined beforehand by specifying a factor polynomial as an input to the numerical search algorithm. Using this coprime-BB construction, we found a number of surprisingly short to medium-length codes that were previously unknown. We also propose a layout on cold atom arrays tailored for coprime-BB codes. The proposed layout reduces both move time for short to medium-length codes and the number of moves of atoms to perform syndrome extractions. We consider an error model with global laser noise on cold atoms, and simulations show that our proposed layout achieves significant improvements over prior work across the simulated codes.