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

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

Hsiang-Ku Lin, Liu, Xingrui, Pak Kau Lim, Leonid P. Pryadko

Published Feb 26, 2025• 21 citations
arXivHTMLPDF

Abstract

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$.

DOI
10.48550/arxiv.2502.19406

Related papers

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

Mohammad Rowshan

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.

cs.ITCross-listedarXiv:2601.01137•IEEE International Symposium on Information Theory (ISIT)•Jan 6, 2026•2 citations

Breaking the bicycle frame: Coset-based quantum LDPC codes

Arda Aydin, Itzhak Tamo, Alexander Barg

Generalizing the construction of two-block group algebra (2BGA) codes, we introduce a family of two-block quantum LDPC codes constructed using the action of a group on the cosets of its subgroup. This replaces the regular group actions of the earlier two-block constructions and significantly expands the search space, yielding new quantum LDPC codes outside the 2BGA family. Through a computer search, we identify several new quantum LDPC codes, including weight-6 codes with parameters $[[48,8,6]]$, $[[96,8,10]]$, and $[[224,12,16]]$, as well as weight-8 codes with parameters $[[84,16,8]]$, $[[112,16,10]]$, $[[128,16,12]]$, and $[[168,16,15]]$. Furthermore, we introduce a maximally packed syndrome extraction schedule of depth $w+2$, including initialization and measurement steps, for any code with a maximum stabilizer weight of $w$ from our family. Under a standard circuit-level noise model, our codes, when decoded using BP-OSD, perform competitively with BB codes, achieving thresholds of $\approx0.65\%$ for the weight-6 family and $\approx0.35\%$ for the weight-8 family. Finally, we introduce a group-theoretic framework to generate sequences of graph-based covers of 2BGA codes, recovering and extending recent results on code constructions of this type.

quant-pharXiv:2606.17268•Jun 17, 2026•10 citations

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

Quantum two-block group algebra codes

Hsiang-Ku Lin, Leonid P. Pryadko

We consider quantum two-block group algebra (2BGA) codes, a family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle codes, except a cyclic group is replaced with an arbitrary finite group, generally non-Abelian. As special cases, 2BGA codes include a subset of square-matrix LP codes over Abelian groups, including quasicyclic codes, and all square-matrix hypergraph-product codes constructed from a pair of classical group codes. We establish criteria for permutation equivalence of 2BGA codes and give bounds for their parameters, both explicit and in relation to other quantum and classical codes. We also enumerate the optimal parameters of all inequivalent binary connected 2BGA codes with stabilizer generator weights $W\ensuremath{\le}8$, of length $n\ensuremath{\le}100$ for Abelian groups, and $n\ensuremath{\le}200$ for non-Abelian groups.

arXiv:2306.16400•Physical Review A•Feb 5, 2024•70 citations

Abelian Multi-Cycle Codes for Single-Shot Error Correction

Hsiang-Ku Lin, Pak Kau Lim, Alexey A. Kovalev +1 more

We construct a family of quantum low-density parity-check codes locally equivalent to higher-dimensional quantum hypergraph-product (QHP) codes. Similarly to QHP codes, the proposed codes have highly redundant sets of low-weight stabilizer generators, which improves decoding accuracy in a fault-tolerant regime and gives them single-shot properties. The advantage of the construction is that it gives shorter codes. We derive simple expressions for the dimension of the proposed codes in two important special cases, give bounds on the distances and explicitly construct some relatively short codes. Circuit simulations for codes locally equivalent to four-dimensional toric codes show a (pseudo)threshold close to 1.1 % , better than for toric or surface codes with a similar noise model.

arXiv:2506.16910•PRX Quantum•Mar 23, 2026•10 citations

Floquet Abelian Multicycle Codes

Alexey A. Kovalev

Abelian multicycle (AMC) codes are compact quantum low-density parity-check codes whose multiblock chain-complex structure provides redundant low-weight stabilizers and supports single-shot error correction. We introduce Floquet AMC codes by deriving a quotient-lattice representation of a general level-$j$, $D$-dimensional AMC complex over a finite Abelian group algebra, lifting this lattice to spacetime, and rotating the circuit-time direction in the associated ZX network. When the check and data spiders have even valence and admit a time-oriented local port matching, the network decomposes into a periodic schedule of native two-qubit $XX$ and $ZZ$ measurements. We construct generalized-bicycle and level-$2$ AMC4 examples, determine their instantaneous stabilizer groups, and compute their embedded distances by minimizing over all inequivalent circuit cuts. For AMC4 instances locally equivalent to four-dimensional toric codes, we obtain Floquet memories with parameters $[[108,6,5]]$, $[[144,6,8]]$, and $[[324,6,10]]$. Local Pauli-web detector templates and beam-search decoding under the measurement-native EM3 noise model yield an estimated pseudothreshold of approximately $1.2\%$. These results provide compact measurement-only realizations of higher-dimensional homological redundancy without directly measuring the original weight-six stabilizers.

quant-pharXiv:2607.27521•Jul 31, 2026•1 citation
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.
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.
Generalizing the construction of two-block group algebra (2BGA) codes, we introduce a family of two-block quantum LDPC codes constructed using the action of a group on the cosets of its subgroup. This replaces the regular group actions of the earlier two-block constructions and significantly expands the search space, yielding new quantum LDPC codes outside the 2BGA family. Through a computer search, we identify several new quantum LDPC codes, including weight-6 codes with parameters [[48,8,6]][[48,8,6]][[48,8,6]], [[96,8,10]][[96,8,10]][[96,8,10]], and [[224,12,16]][[224,12,16]][[224,12,16]], as well as weight-8 codes with parameters [[84,16,8]][[84,16,8]][[84,16,8]], [[112,16,10]][[112,16,10]][[112,16,10]], [[128,16,12]][[128,16,12]][[128,16,12]], and [[168,16,15]][[168,16,15]][[168,16,15]]. Furthermore, we introduce a maximally packed syndrome extraction schedule of depth w+2w+2w+2, including initialization and measurement steps, for any code with a maximum stabilizer weight of www from our family. Under a standard circuit-level noise model, our codes, when decoded using BP-OSD, perform competitively with BB codes, achieving thresholds of ≈0.65%\approx0.65\%≈0.65% for the weight-6 family and ≈0.35%\approx0.35\%≈0.35% for the weight-8 family. Finally, we introduce a group-theoretic framework to generate sequences of graph-based covers of 2BGA codes, recovering and extending recent results on code constructions of this type.
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 consider quantum two-block group algebra (2BGA) codes, a family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle codes, except a cyclic group is replaced with an arbitrary finite group, generally non-Abelian. As special cases, 2BGA codes include a subset of square-matrix LP codes over Abelian groups, including quasicyclic codes, and all square-matrix hypergraph-product codes constructed from a pair of classical group codes. We establish criteria for permutation equivalence of 2BGA codes and give bounds for their parameters, both explicit and in relation to other quantum and classical codes. We also enumerate the optimal parameters of all inequivalent binary connected 2BGA codes with stabilizer generator weights $W\ensuremath{\le}8$, of length $n\ensuremath{\le}100$ for Abelian groups, and $n\ensuremath{\le}200$ for non-Abelian groups.
We construct a family of quantum low-density parity-check codes locally equivalent to higher-dimensional quantum hypergraph-product (QHP) codes. Similarly to QHP codes, the proposed codes have highly redundant sets of low-weight stabilizer generators, which improves decoding accuracy in a fault-tolerant regime and gives them single-shot properties. The advantage of the construction is that it gives shorter codes. We derive simple expressions for the dimension of the proposed codes in two important special cases, give bounds on the distances and explicitly construct some relatively short codes. Circuit simulations for codes locally equivalent to four-dimensional toric codes show a (pseudo)threshold close to 1.1 % , better than for toric or surface codes with a similar noise model.
Abelian multicycle (AMC) codes are compact quantum low-density parity-check codes whose multiblock chain-complex structure provides redundant low-weight stabilizers and supports single-shot error correction. We introduce Floquet AMC codes by deriving a quotient-lattice representation of a general level-jjj, DDD-dimensional AMC complex over a finite Abelian group algebra, lifting this lattice to spacetime, and rotating the circuit-time direction in the associated ZX network. When the check and data spiders have even valence and admit a time-oriented local port matching, the network decomposes into a periodic schedule of native two-qubit XXXXXX and ZZZZZZ measurements. We construct generalized-bicycle and level-222 AMC4 examples, determine their instantaneous stabilizer groups, and compute their embedded distances by minimizing over all inequivalent circuit cuts. For AMC4 instances locally equivalent to four-dimensional toric codes, we obtain Floquet memories with parameters [[108,6,5]][[108,6,5]][[108,6,5]], [[144,6,8]][[144,6,8]][[144,6,8]], and [[324,6,10]][[324,6,10]][[324,6,10]]. Local Pauli-web detector templates and beam-search decoding under the measurement-native EM3 noise model yield an estimated pseudothreshold of approximately 1.2%1.2\%1.2%. These results provide compact measurement-only realizations of higher-dimensional homological redundancy without directly measuring the original weight-six stabilizers.