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

Coset Lifted Product Codes: Constructing Quantum LDPC Codes from Non-Normal Subgroup Actions

Rajendra Prasad Rajpurohit, V. Lalitha, Shayan Srinivasa Garani

quant-phcs.ITSubmitted Oct 8, 2026• Announced Oct 12, 2026• 0 citations
arXivHTMLPDF

Abstract

We introduce coset lifted product (CLP) codes, a family of quantum LDPC codes that combine the protograph structure of lifted product codes with the coset action of Aydin, Tamo, and Barg \cite{AydinTamoBarg2026}. Given a finite group $G$, a subgroup $H \le G$ that need not be normal, a protograph $A$ over $\mathbb F_2[G]$, and a protograph $B$ over $\mathbb F_2[N_G(H)]$, the two protographs act on the cosets $G/H$ from the left and from the right to produce quantum CSS codes. Further, for groups of odd order, we give an explicit formula for the dimension as a sum over the irreducible representations $ρ$ of $G$ of hypergraph product dimensions. A search over $14,843$ pairs $(G,H)$ with $H$ restricted to be non-normal and $120 \le n \le 400$ yields certified codes that exceed the best published value of $Q=kd^2/n$ at check weights $6,7$ and $9$, i.e., we obtain $[[360,20,20]]$ at $w=6$, a $[[360,24,20]]$ code at $w=7$, and codes $[[252,16,18]]$ and $[[288,16,20]]$ at $w=9$. Our search also produce high-distance codes with parameters $[[168,10,14]], [[240,8,20]]$ at $w=6$ and $[[216,8,18]]$ at $w=7$.

AI Summary

The paper asks how non-normal subgroup coset actions can be incorporated into lifted-product quantum LDPC constructions, and whether the resulting design space yields improved finite-length code parameters. It defines coset lifted product (CLP) codes using a protograph $A$ over $\mathbb F_2[G]$ acting on $G/H$ from the left and a protograph $B$ over $\mathbb F_2[N_G(H)]$ acting from the right. These commuting actions guarantee CSS orthogonality for arbitrary protograph sizes. The construction includes regular-action lifted products and previously introduced coset-based two-block codes. For groups of odd order, a representation-theoretic decomposition gives an explicit dimension formula as a sum of hypergraph-product dimensions. Each summand uses the image of $A$ in an irreducible representation and the induced action of $B$ on its multiplicity space, whose dimension is the dimension of the subgroup-fixed space. A restricted search over $14{,}843$ group–subgroup pairs, primarily using a scalar $A$ and a $2\times2$ protograph $B$, produces certified codes reported to exceed published values of $Q=kd^2/n$ at fixed maximum check weights: $[[360,20,20]]$ at weight 6, $[[360,24,20]]$ at weight 7, and $[[252,16,18]]$ and $[[288,16,20]]$ at weight 9. Distances are screened with randomized searches and certified using integer programming over logical-operator sectors; construction data are printed. The dimension formula is restricted to odd-order groups. Several additional candidates have only distance upper bounds, with higher bounds explicitly flagged as potentially unstable under longer searches. The numerical search covers restricted subgroup choices, protograph layouts, and block lengths.

Some signs of AI-generated textIncremental

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

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

Logical Spectroscopy: Lifted-Product Codes with Addressable Bases

Jong Yeon Lee

Quantum LDPC memories can encode many logical qubits, but that alone does not make them usable: applications need to know where the logical operators are supported, how they are labeled, and how conjugate $X/Z$ partners pair. For hypergraph-product codes this information follows from row reduction over $\mathbb{F}_2$. For Abelian lifted-product codes, which include prominent high-rate constructions, it does not: the entries of the defining seed matrices live in a group algebra rather than a field, so pivots need not be invertible and row reduction can fail. To address this problem, we introduce \emph{logical spectroscopy}. For an odd-order Abelian lift group, the Chinese remainder theorem splits the group algebra into finite fields, one for each Frobenius orbit of characters; we call these orbits packets. Packet by packet, we solve ordinary finite-field linear algebra, lift the answers back to the physical code with the associated packet projectors, and pair $X$ and $Z$ logicals between reciprocal packets by trace duality. The result is a complete conjugate logical basis for a finite Abelian lifted product code that is addressable: every logical coordinate carries canonical packet and Künneth-summand labels, deterministic within-block indices, a conjugate partner, and an explicit binary representative. The code's own translation symmetry then acts on these coordinates in closed form. We apply the construction to examples with up to 5000 physical qubits, including high-rate examples whose distance-witness is reported explicitly. We further extend the decomposition to even-order lifts. Logical spectroscopy thus equips Abelian lifted products with an explicit logical coordinate system and an algebraic toolkit for high-rate code search.

quant-pharXiv:2607.05386•Jul 7, 2026•10 citations

Quantum Tanner Codes at Moderate Blocklength

Feroz Ahmed Mian, Vaishnavi L. Addala, Arman Meraj +2 more

We present explicit constructions of quantum Tanner (QT) codes with good rate and distance, obtained through two complementary approaches: the left-right Cayley complex (LRCC) description and the "lifting" perspective, in which a seed Calderbank-Shor-Steane (CSS) code is lifted by commuting left-right regular actions of a finite group $\mathcal{G}$. Through an extensive search over non-abelian groups from GAP's SmallGrp library, we investigate the moderate-blocklength regime ($n \in [500,1000]$) and identify several new code instances with distance upper bounds exceeding $20$. These include $[[480,8,(\leq 21,\leq 21)]]$, $[[504,4,(\leq 36,\leq 27)]]$, $[[672,4,(\leq 48,\leq 28)]]$, $[[720,6,(\leq 30,\leq 30)]]$, and $[[864,8,(\leq 39,\leq 31)]]$, with these bounds obtained using up to $350$ million trials of sQetch, a randomized distance estimator. The code instances presented have check weights ranging from $9$ to $20$. Using the Tesseract decoder, we estimate pseudo-thresholds of $3.6\%$-$4.6\%$ under phenomenological noise and $0.14\%$-$0.27\%$ under circuit-level noise, comparable to prior results at shorter code lengths. We also provide QuantumExpanders$.$jl, an open-source Julia library for constructing QT codes and explicit constructions of Ramanujan graphs.

quant-pharXiv:2608.12509•Aug 14, 2026•0 citations

Multi-agent discovery of practical quantum LDPC codes

Dongheng Qian, Tianyi Li

Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks, yet searching for useful finite-length instances remains a challenging design problem because code performance must be optimized while satisfying practical constraints. Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes. The framework combines specialist proposal and review, persistent scientific memory, long-horizon evolution of executable programs, and deterministic construction and evaluation within a closed-loop search. These programs instantiate coset-orbit balanced-product codes, providing a search space that includes bicycle and lifted-product constructions as well as non-normal subgroup actions. To incorporate practical constraints, we restrict the search to binary CSS codes with block length $n\leq400$ and overall weight $w\leq10$. Within this regime, the framework discovers codes with leading or competitive rate--distance performance in every weight class considered, with representative instances including $[[288,16,18]]$ at $w=7$, $[[288,18,18]]$ at $w=9$, and $[[234,28,18]]$ at $w=10$. The search also uncovers structurally distinct, high-performing constructions, including a $[[336,12,\leq24]]$ candidate and a $[[368,18,16]]$ code, both of which are genuine balanced-product constructions with non-normal subgroup actions. When evaluated under code-capacity depolarizing noise using a common BP-OSD decoding protocol, the discovered codes also exhibit low logical failure rates. Together, these results provide hardware-relevant finite-length candidates for further experimental evaluation and show how structured agentic search can contribute to scientific discovery.

quant-pharXiv:2608.08996•Aug 11, 2026•8 citations

High-Girth Regular Quantum LDPC Codes from Square-Base Hypergraph Products via CPM Lifts

Koki Okada, Kenta Kasai

We study square-base Calderbank--Shor--Steane (CSS) hypergraph-product codes as a finite-length class for regular high-girth quantum low-density parity-check (LDPC) design. For base matrices of small column weight, we give checkable conditions for regularity, rank deficiency, and short-cycle exclusion, and we present explicit column-weight-three and column-weight-four examples with Tanner girth 6 and 8. We also analyze circulant permutation matrix (CPM) lifts of this class. Using the standard voltage-sum criterion, we identify orthogonality-forced Tanner 8-cycles and show that CPM lifting cannot raise the Tanner girth beyond 8 when these cycles are present. As a representative finite-length instance, a randomized CPM lift of the girth-8 base construction gives a $[[28800,62,18\le d\le192]]$ girth-8 $(3,6)$-regular CSS-LDPC code. Complete enumeration excludes nontrivial logical supports of weight at most $16$ on both sides, giving $d_X,d_Z\ge18$; explicit weight-$192$ representatives give $d_X,d_Z\le192$. Under degeneracy-aware belief-propagation decoding with optional ordered-statistics-decoding-lite post-processing, this code produced zero decoding failures in $2.993\times 10^8$ independent trials at depolarizing probability $p=0.1402$; the Wilson 95\% upper confidence bound is $1.28\times 10^{-8}$.

quant-pharXiv:2604.27817•May 1, 2026•5 citations

Protograph Quantum LDPC Codes from Tensor Product of Parity-Check Matrices

Yixuan Xie, Jinhong Yuan

We propose two constructions, namely Construction 1 and Construction 2, for the design of protograph quantum LDPC codes by exploiting conventional quasi cyclic protograph LDPC codes with lift operation, and tensor product operation, respectively. We show that by carefully designing the proto-matrix using quadratic residue sets of parameters p = 4n ± 1, the proposed Construction 1 yields protograph quantum LDPC codes of various rates. Furthermore, by performing tensor product between two non-binary parity-check matrices obtained from idempotent polynomials of a quadratic residue set, the proposed Construction 2 yields a class of protograph quantum LDPC codes with rate at least 0.9. The performance of the proposed codes over quantum depolarizing channel with iterative sum-product decoding algorithm is shown.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2015•3 citations
We introduce coset lifted product (CLP) codes, a family of quantum LDPC codes that combine the protograph structure of lifted product codes with the coset action of Aydin, Tamo, and Barg \cite{AydinTamoBarg2026}. Given a finite group GGG, a subgroup H≤GH \le GH≤G that need not be normal, a protograph AAA over F2[G]\mathbb F_2[G]F2​[G], and a protograph BBB over F2[NG(H)]\mathbb F_2[N_G(H)]F2​[NG​(H)], the two protographs act on the cosets G/HG/HG/H from the left and from the right to produce quantum CSS codes. Further, for groups of odd order, we give an explicit formula for the dimension as a sum over the irreducible representations ρρρ of GGG of hypergraph product dimensions. A search over 14,84314,84314,843 pairs (G,H)(G,H)(G,H) with HHH restricted to be non-normal and 120≤n≤400120 \le n \le 400120≤n≤400 yields certified codes that exceed the best published value of Q=kd2/nQ=kd^2/nQ=kd2/n at check weights 6,76,76,7 and 999, i.e., we obtain [[360,20,20]][[360,20,20]][[360,20,20]] at w=6w=6w=6, a [[360,24,20]][[360,24,20]][[360,24,20]] code at w=7w=7w=7, and codes [[252,16,18]][[252,16,18]][[252,16,18]] and [[288,16,20]][[288,16,20]][[288,16,20]] at w=9w=9w=9. Our search also produce high-distance codes with parameters [[168,10,14]],[[240,8,20]][[168,10,14]], [[240,8,20]][[168,10,14]],[[240,8,20]] at w=6w=6w=6 and [[216,8,18]][[216,8,18]][[216,8,18]] at w=7w=7w=7.
The paper asks how non-normal subgroup coset actions can be incorporated into lifted-product quantum LDPC constructions, and whether the resulting design space yields improved finite-length code parameters. It defines coset lifted product (CLP) codes using a protograph AAA over F2[G]\mathbb F_2[G]F2​[G] acting on G/HG/HG/H from the left and a protograph BBB over F2[NG(H)]\mathbb F_2[N_G(H)]F2​[NG​(H)] acting from the right. These commuting actions guarantee CSS orthogonality for arbitrary protograph sizes. The construction includes regular-action lifted products and previously introduced coset-based two-block codes.
For groups of odd order, a representation-theoretic decomposition gives an explicit dimension formula as a sum of hypergraph-product dimensions. Each summand uses the image of AAA in an irreducible representation and the induced action of BBB on its multiplicity space, whose dimension is the dimension of the subgroup-fixed space.
A restricted search over 14,84314{,}84314,843 group–subgroup pairs, primarily using a scalar AAA and a 2×22\times22×2 protograph BBB, produces certified codes reported to exceed published values of Q=kd2/nQ=kd^2/nQ=kd2/n at fixed maximum check weights: [[360,20,20]][[360,20,20]][[360,20,20]] at weight 6, [[360,24,20]][[360,24,20]][[360,24,20]] at weight 7, and [[252,16,18]][[252,16,18]][[252,16,18]] and [[288,16,20]][[288,16,20]][[288,16,20]] at weight 9. Distances are screened with randomized searches and certified using integer programming over logical-operator sectors; construction data are printed.
The dimension formula is restricted to odd-order groups. Several additional candidates have only distance upper bounds, with higher bounds explicitly flagged as potentially unstable under longer searches. The numerical search covers restricted subgroup choices, protograph layouts, and block lengths.
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.
Quantum LDPC memories can encode many logical qubits, but that alone does not make them usable: applications need to know where the logical operators are supported, how they are labeled, and how conjugate X/ZX/ZX/Z partners pair. For hypergraph-product codes this information follows from row reduction over F2\mathbb{F}_2F2​. For Abelian lifted-product codes, which include prominent high-rate constructions, it does not: the entries of the defining seed matrices live in a group algebra rather than a field, so pivots need not be invertible and row reduction can fail. To address this problem, we introduce \emph{logical spectroscopy}. For an odd-order Abelian lift group, the Chinese remainder theorem splits the group algebra into finite fields, one for each Frobenius orbit of characters; we call these orbits packets. Packet by packet, we solve ordinary finite-field linear algebra, lift the answers back to the physical code with the associated packet projectors, and pair XXX and ZZZ logicals between reciprocal packets by trace duality. The result is a complete conjugate logical basis for a finite Abelian lifted product code that is addressable: every logical coordinate carries canonical packet and Künneth-summand labels, deterministic within-block indices, a conjugate partner, and an explicit binary representative. The code's own translation symmetry then acts on these coordinates in closed form. We apply the construction to examples with up to 5000 physical qubits, including high-rate examples whose distance-witness is reported explicitly. We further extend the decomposition to even-order lifts. Logical spectroscopy thus equips Abelian lifted products with an explicit logical coordinate system and an algebraic toolkit for high-rate code search.
We present explicit constructions of quantum Tanner (QT) codes with good rate and distance, obtained through two complementary approaches: the left-right Cayley complex (LRCC) description and the "lifting" perspective, in which a seed Calderbank-Shor-Steane (CSS) code is lifted by commuting left-right regular actions of a finite group G\mathcal{G}G. Through an extensive search over non-abelian groups from GAP's SmallGrp library, we investigate the moderate-blocklength regime (n∈[500,1000]n \in [500,1000]n∈[500,1000]) and identify several new code instances with distance upper bounds exceeding 202020. These include [[480,8,(≤21,≤21)]][[480,8,(\leq 21,\leq 21)]][[480,8,(≤21,≤21)]], [[504,4,(≤36,≤27)]][[504,4,(\leq 36,\leq 27)]][[504,4,(≤36,≤27)]], [[672,4,(≤48,≤28)]][[672,4,(\leq 48,\leq 28)]][[672,4,(≤48,≤28)]], [[720,6,(≤30,≤30)]][[720,6,(\leq 30,\leq 30)]][[720,6,(≤30,≤30)]], and [[864,8,(≤39,≤31)]][[864,8,(\leq 39,\leq 31)]][[864,8,(≤39,≤31)]], with these bounds obtained using up to 350350350 million trials of sQetch, a randomized distance estimator. The code instances presented have check weights ranging from 999 to 202020. Using the Tesseract decoder, we estimate pseudo-thresholds of 3.6%3.6\%3.6%-4.6%4.6\%4.6% under phenomenological noise and 0.14%0.14\%0.14%-0.27%0.27\%0.27% under circuit-level noise, comparable to prior results at shorter code lengths. We also provide QuantumExpanders...jl, an open-source Julia library for constructing QT codes and explicit constructions of Ramanujan graphs.
Quantum low-density parity-check (qLDPC) codes can encode multiple logical qubits using sparse parity checks, yet searching for useful finite-length instances remains a challenging design problem because code performance must be optimized while satisfying practical constraints. Motivated by recent advances in artificial-intelligence agents for scientific discovery, we develop a multi-agent framework for discovering practical qLDPC codes. The framework combines specialist proposal and review, persistent scientific memory, long-horizon evolution of executable programs, and deterministic construction and evaluation within a closed-loop search. These programs instantiate coset-orbit balanced-product codes, providing a search space that includes bicycle and lifted-product constructions as well as non-normal subgroup actions. To incorporate practical constraints, we restrict the search to binary CSS codes with block length n≤400n\leq400n≤400 and overall weight w≤10w\leq10w≤10. Within this regime, the framework discovers codes with leading or competitive rate--distance performance in every weight class considered, with representative instances including [[288,16,18]][[288,16,18]][[288,16,18]] at w=7w=7w=7, [[288,18,18]][[288,18,18]][[288,18,18]] at w=9w=9w=9, and [[234,28,18]][[234,28,18]][[234,28,18]] at w=10w=10w=10. The search also uncovers structurally distinct, high-performing constructions, including a [[336,12,≤24]][[336,12,\leq24]][[336,12,≤24]] candidate and a [[368,18,16]][[368,18,16]][[368,18,16]] code, both of which are genuine balanced-product constructions with non-normal subgroup actions. When evaluated under code-capacity depolarizing noise using a common BP-OSD decoding protocol, the discovered codes also exhibit low logical failure rates. Together, these results provide hardware-relevant finite-length candidates for further experimental evaluation and show how structured agentic search can contribute to scientific discovery.
We study square-base Calderbank--Shor--Steane (CSS) hypergraph-product codes as a finite-length class for regular high-girth quantum low-density parity-check (LDPC) design. For base matrices of small column weight, we give checkable conditions for regularity, rank deficiency, and short-cycle exclusion, and we present explicit column-weight-three and column-weight-four examples with Tanner girth 6 and 8. We also analyze circulant permutation matrix (CPM) lifts of this class. Using the standard voltage-sum criterion, we identify orthogonality-forced Tanner 8-cycles and show that CPM lifting cannot raise the Tanner girth beyond 8 when these cycles are present. As a representative finite-length instance, a randomized CPM lift of the girth-8 base construction gives a [[28800,62,18≤d≤192]][[28800,62,18\le d\le192]][[28800,62,18≤d≤192]] girth-8 (3,6)(3,6)(3,6)-regular CSS-LDPC code. Complete enumeration excludes nontrivial logical supports of weight at most 161616 on both sides, giving dX,dZ≥18d_X,d_Z\ge18dX​,dZ​≥18; explicit weight-192192192 representatives give dX,dZ≤192d_X,d_Z\le192dX​,dZ​≤192. Under degeneracy-aware belief-propagation decoding with optional ordered-statistics-decoding-lite post-processing, this code produced zero decoding failures in 2.993×1082.993\times 10^82.993×108 independent trials at depolarizing probability p=0.1402p=0.1402p=0.1402; the Wilson 95\% upper confidence bound is 1.28×10−81.28\times 10^{-8}1.28×10−8.
We propose two constructions, namely Construction 1 and Construction 2, for the design of protograph quantum LDPC codes by exploiting conventional quasi cyclic protograph LDPC codes with lift operation, and tensor product operation, respectively. We show that by carefully designing the proto-matrix using quadratic residue sets of parameters p = 4n ± 1, the proposed Construction 1 yields protograph quantum LDPC codes of various rates. Furthermore, by performing tensor product between two non-binary parity-check matrices obtained from idempotent polynomials of a quadratic residue set, the proposed Construction 2 yields a class of protograph quantum LDPC codes with rate at least 0.9. The performance of the proposed codes over quantum depolarizing channel with iterative sum-product decoding algorithm is shown.