A finite-field two-branch coset construction generates regular CSS LDPC bases for multiple (J,L) pairs, with a (3,10) example lifted 64-fold to a [[10240,4108,10≤d≤32]] code and post-processed FER of 1e-7 at p=0.058.
Fiber bundle codes: Breaking the N 1/2 polylog(N) barrier for quantum LDPC codes,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Two-Branch Finite-Field Construction for Regular CSS LDPC Bases
A finite-field two-branch coset construction generates regular CSS LDPC bases for multiple (J,L) pairs, with a (3,10) example lifted 64-fold to a [[10240,4108,10≤d≤32]] code and post-processed FER of 1e-7 at p=0.058.