[Jump to code hierarchy]

Coset-based quantum LDPC code[1]

Description

A two-block CSS code \(Q_G^H(a,b)\) built from the action of a finite group \(G\) on the left cosets \(G/H\) of a subgroup \(H\), generalizing 2BGA codes to a much larger family of quantum LDPC codes. The length \(n=2[G:H]\) is even, being twice the index of \(H\) in \(G\).

The building blocks are permutation matrices \(\mathbf{L}(g)\) and \(\mathbf{R}(g)\) representing, respectively, the left action of \(G\) and the right action of the normalizer \(N_G(H)\) on the \(m=[G:H]\) cosets. These two actions commute, so for group algebra elements \(a\in\mathbb{F}_q[G]\) and \(b\in\mathbb{F}_q[N_G(H)]\) the matrices \(\mathbf{L}(a)\) and \(\mathbf{R}(b)\) commute and yield a valid CSS code with parity-check matrices \begin{align} H_X=[\mathbf{L}(a)\mid \mathbf{R}(b)]~,\qquad H_Z=[-\mathbf{R}(b)^T\mid \mathbf{L}(a)^T] \tag*{(1)}\end{align} on \(n=2m\) qudits, with stabilizer generators of weight at most \(w_a+w_b\), where \(w_a\) and \(w_b\) are the weights of \(a\) and \(b\) [1].

A computer search over non-abelian groups and their non-normal subgroups yields new weight-six codes \([[48,8,6]]\), \([[96,8,10]]\), and \([[224,12,16]]\), and weight-eight codes \([[84,16,8]]\), \([[112,16,10]]\), \([[128,16,12]]\), and \([[168,16,15]]\) [1].

Decoding

BP-OSD decoding; performance under several decoders is compared in Ref. [1].A maximally packed syndrome-extraction circuit of depth \(w+2\), including state initialization and measurement, exists for any code of maximum stabilizer weight \(w\), generalizing the depth-eight bivariate bicycle schedule [1].

Threshold

Circuit-level noise thresholds of \(\approx 0.65\%\) for the weight-six family and \(\approx 0.35\%\) for the weight-eight family under BP-OSD decoding [1].

Primary Hierarchy

Parents
Coset-based codes are two-block CSS codes whose commuting blocks \(\mathbf{L}(a)\) and \(\mathbf{R}(b)\) are the matrices of a group acting on the left and right of the cosets of a subgroup [1].
A coset-based code \(Q_G^H(a,b)\) has stabilizer generators of weight at most \(w_a+w_b\), so it is a quantum LDPC code when \(a\) and \(b\) have bounded weight [1].
Coset-based quantum LDPC code
Children
2BGA codes are the coset-based codes \(Q_G^H(a,b)\) for which \(H\) is a normal subgroup of \(G\), in which case the coset actions reduce to the left and right regular actions of the quotient group \(G/H\) [1]. A group-theoretic framework generates sequences of 2BGA codes as graph-based covers of a small base 2BGA code, recovering and generalizing the bivariate bicycle covering-graph sequences of Symons, Rajput, and Browne [2] to arbitrary (including non-Abelian) group extensions [1].

References

[1]
A. Aydin, I. Tamo, and A. Barg, “Breaking the bicycle frame: Coset-based quantum LDPC codes”, (2026) arXiv:2606.17268
[2]
B. C. B. Symons, A. Rajput, and D. E. Browne, “Sequences of Bivariate Bicycle Codes from Covering Graphs”, (2026) arXiv:2511.13560
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)

— see instructions

Zoo Code ID: coset_code

Cite as:
“Coset-based quantum LDPC code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/coset_code, arXiv:2606.11484
BibTeX:
@incollection{eczoo_coset_code,
title={Coset-based quantum LDPC code},
booktitle={The Error Correction Zoo},
year={2026},
editor={Albert, Victor V. and Faist, Philippe},
eprint={2606.11484},
doi={10.48550/arXiv.2606.11484},
url={https://errorcorrectionzoo.org/c/coset_code}
}
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/coset_code

Cite as:

“Coset-based quantum LDPC code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2026. https://errorcorrectionzoo.org/c/coset_code, arXiv:2606.11484

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qudits_galois/stabilizer/qldpc/coset_code.yml.