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:2409.09830 · Allerton Conference on Communication, Control, and Computing

Quantum Margulis Codes

Michele Pacenti, Bane V. Vasic

Published Sep 24, 2024• 4 citations
arXivHTMLPDF

Abstract

Recently, Lin and Pryadko [1] presented the quan-tum two-block group algebra codes, a generalization of bicycle codes obtained from Cayley graphs of non-Abelian groups. We notice that their construction is naturally suitable to obtain a quantum equivalent of the well-known classical Margulis code. In this paper, we first present an alternative description of the two-block group algebra codes using the left-right Cayley complex; then, we show how to modify the construction of Margulis to get a two-block group algebra code. Finally, we construct several quantum Margulis codes and evaluate their performance with numerical simulations.

DOI
10.1109/allerton63246.2024.10735283

Related papers

Construction and Decoding of Quantum Margulis Codes

Michele Pacenti, Dimitris Chytas, Bane V. Vasic

Quantum low-density parity-check codes are a promising approach to fault-tolerant quantum computation, offering potential advantages in rate and decoding efficiency. In this work, we introduce quantum Margulis codes, a new class of QLDPC codes derived from Margulis' classical LDPC construction via the two-block group algebra framework. We show that quantum Margulis codes, unlike bivariate bicycle codes which require ordered statistics decoding for effective error correction, can be efficiently decoded using a standard min-sum decoder with linear complexity, when decoded under the code capacity noise model. This is attributed to their Tanner graph structure, which does not exhibit group symmetry, thereby mitigating the well-known problem of error degeneracy in QLDPC decoding. To further enhance performance, we propose an algorithm for constructing 2BGA codes with controlled girth, ensuring a minimum girth of 6 or 8, and use it to generate several quantum Margulis codes of length 240 and 642. We validate our approach through numerical simulations, demonstrating that quantum Margulis codes behave significantly better than BB codes in the error floor region, under min-sum decoding.

arXiv:2503.03936•Quantum•May 12, 2026•5 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

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

Bicycle Race: small two-block codes on the Pareto frontier

Gideon Lee

Two-block group-algebra codes are among the simplest quantum LDPC codes, and many of them are translation invariant on a twisted torus, which suits neutral-atom arrays and other platforms with movable qubits. We ask how far they go at small sizes when searched systematically across all groups. We use algebraic constraints and screens to design a search pipeline capable of enumerating broad and complete swathes of two-block codes on a laptop. With it we census about $10^8$ two-block codes with up to $320$ qubits at check weights five to nine. Several of these censuses are exhaustive, and support complete statements; for instance, the Gross code is, up to equivalence, the only abelian weight-six two-block code with $n \le 200$ to reach $kd^2/n=12$, no weight-six two-block code with $n \le 300$ beats $[[288,16,16]]$, and the known $[[64,18,8]]$ is the best two-block code by $kd^2/n$ across weights five to nine with $n \le 94$. The censuses are also large enough to give insights into where good codes live - they concentrate in a handful of groups; abelian groups give the best codes at small $n$ and non-abelian groups at large $n$, with the crossover appearing to move out as the check weight grows; and high quality codes become $100$ to $1000$ times rarer per draw from weight six to weights eight and nine. Using the group algebra and the census data to steer a statistical search finds four to fifteen times as many good codes as uniform draws in equal time. Among the codes found are $[[102,20,10]]$ and $[[120,24,10]]$ at check weight nine, which we simulate in noisy syndrome-extraction circuits, and $[[186,20,18]]$, a weight-nine code with every check in a $5\times5$ window. At check weights seven to nine, our best codes exceed the best published $kd^2/n$ with exact distance at the same check weight in most length bands up to $320$ qubits. All codes are available in a public database.

quant-pharXiv:2610.13880•Oct 12, 2026•1 citation

Abelian and Non-Abelian Quantum Two-Block Codes

Renyu Wang, Hsiang-Ku Lin, Leonid P. Pryadko

We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices. Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian. We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian. This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such a code based on an abelian group. We also give a lower bound on the distance which, in particular, applies to the case when a 2BGA code reduces to a hypergraph-product code constructed from a pair of classical group codes.

arXiv:2305.06890•International Symposium on Turbo Codes and Iterative Information Processing•Sep 4, 2023•26 citations

Improved Construction of Generalized Quantum Tanner Codes

Olai Å. Mostad, Eirik Rosnes, Hsuan-Yin Lin

We propose a generalization of the recently proposed quantum Tanner codes by Leverrier and Zemor. These codes can be constructed equivalently from groups, Cayley graphs, or square complexes constructed from groups. In a recent work, we enlarged this to group actions on finite sets, Schreier graphs, and a family of square complexes. We extend the class of quantum Tanner codes further by replacing the tensor product code in the construction with a Tanner code on any bipartite graph. A stricter property on the other underlying graphs is required, and we show that a common variation of the construction can always be taken to satisfy this condition. This results in improved codes compared to the ones constructed based on Schreier graphs.

International Symposium on Turbo Codes and Iterative Information Processing•Aug 18, 2025•1 citation
Recently, Lin and Pryadko [1] presented the quan-tum two-block group algebra codes, a generalization of bicycle codes obtained from Cayley graphs of non-Abelian groups. We notice that their construction is naturally suitable to obtain a quantum equivalent of the well-known classical Margulis code. In this paper, we first present an alternative description of the two-block group algebra codes using the left-right Cayley complex; then, we show how to modify the construction of Margulis to get a two-block group algebra code. Finally, we construct several quantum Margulis codes and evaluate their performance with numerical simulations.
Quantum low-density parity-check codes are a promising approach to fault-tolerant quantum computation, offering potential advantages in rate and decoding efficiency. In this work, we introduce quantum Margulis codes, a new class of QLDPC codes derived from Margulis' classical LDPC construction via the two-block group algebra framework. We show that quantum Margulis codes, unlike bivariate bicycle codes which require ordered statistics decoding for effective error correction, can be efficiently decoded using a standard min-sum decoder with linear complexity, when decoded under the code capacity noise model. This is attributed to their Tanner graph structure, which does not exhibit group symmetry, thereby mitigating the well-known problem of error degeneracy in QLDPC decoding. To further enhance performance, we propose an algorithm for constructing 2BGA codes with controlled girth, ensuring a minimum girth of 6 or 8, and use it to generate several quantum Margulis codes of length 240 and 642. We validate our approach through numerical simulations, demonstrating that quantum Margulis codes behave significantly better than BB codes in the error floor region, under min-sum decoding.
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.
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.
Two-block group-algebra codes are among the simplest quantum LDPC codes, and many of them are translation invariant on a twisted torus, which suits neutral-atom arrays and other platforms with movable qubits. We ask how far they go at small sizes when searched systematically across all groups. We use algebraic constraints and screens to design a search pipeline capable of enumerating broad and complete swathes of two-block codes on a laptop. With it we census about 10810^8108 two-block codes with up to 320320320 qubits at check weights five to nine. Several of these censuses are exhaustive, and support complete statements; for instance, the Gross code is, up to equivalence, the only abelian weight-six two-block code with n≤200n \le 200n≤200 to reach kd2/n=12kd^2/n=12kd2/n=12, no weight-six two-block code with n≤300n \le 300n≤300 beats [[288,16,16]][[288,16,16]][[288,16,16]], and the known [[64,18,8]][[64,18,8]][[64,18,8]] is the best two-block code by kd2/nkd^2/nkd2/n across weights five to nine with n≤94n \le 94n≤94. The censuses are also large enough to give insights into where good codes live - they concentrate in a handful of groups; abelian groups give the best codes at small nnn and non-abelian groups at large nnn, with the crossover appearing to move out as the check weight grows; and high quality codes become 100100100 to 100010001000 times rarer per draw from weight six to weights eight and nine. Using the group algebra and the census data to steer a statistical search finds four to fifteen times as many good codes as uniform draws in equal time. Among the codes found are [[102,20,10]][[102,20,10]][[102,20,10]] and [[120,24,10]][[120,24,10]][[120,24,10]] at check weight nine, which we simulate in noisy syndrome-extraction circuits, and [[186,20,18]][[186,20,18]][[186,20,18]], a weight-nine code with every check in a 5×55\times55×5 window. At check weights seven to nine, our best codes exceed the best published kd2/nkd^2/nkd2/n with exact distance at the same check weight in most length bands up to 320320320 qubits. All codes are available in a public database.
We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices. Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic group is replaced with an arbitrary finite group, generally non-abelian. We present code construction and give several expressions for code dimension, applicable depending on whether the constituent group is cyclic, abelian, or non-abelian. This gives a simple criterion for an essentially non-abelian 2BGA code guaranteed not to be permutation-equivalent to such a code based on an abelian group. We also give a lower bound on the distance which, in particular, applies to the case when a 2BGA code reduces to a hypergraph-product code constructed from a pair of classical group codes.
We propose a generalization of the recently proposed quantum Tanner codes by Leverrier and Zemor. These codes can be constructed equivalently from groups, Cayley graphs, or square complexes constructed from groups. In a recent work, we enlarged this to group actions on finite sets, Schreier graphs, and a family of square complexes. We extend the class of quantum Tanner codes further by replacing the tensor product code in the construction with a Tanner code on any bipartite graph. A stricter property on the other underlying graphs is required, and we show that a common variation of the construction can always be taken to satisfy this condition. This results in improved codes compared to the ones constructed based on Schreier graphs.