A framework guides OSD list construction and compression by identifying coverage requirements and distinguishing coverage losses from failures of representative selection, and separating absent-class from wrong-selection failures.
Abstract
Quantum decoding succeeds when a correction matches the logical class of the error, whereas ordered-statistics decoding (OSD) searches a finite list of physical corrections. We connect these spaces through a rank-$k$ logical-signature map $M_{\rm log}:\mathbb F_2^q\to\mathbb F_2^k$. For fixed, error-independent orderings it yields the exact logical-signature distribution, the OSD-0 logical error rate, and the logical-class coverage of any fixed list. For minimum-cost list decoding we prove $P_L=P_{\rm miss}+P_{\rm sel}$, separating absent-class from wrong-selection failures. Hypergraph-product and bivariate-bicycle codes are consistent with the coverage predictions. On the $[\![144,12,12]\!]$ gross code, 672 coverage-aware candidates outperform 899 combination-sweep candidates (paired McNemar $p=0.013$), while two lists with identical logical coverage give $P_L=11.30\%$ and $3.78\%$; the signature-based coverage compression persists across 30 random column orderings. Logical coverage and within-class representative selection are therefore complementary resources that candidate count alone does not capture. The framework guides OSD list construction and compression by identifying coverage requirements and distinguishing coverage losses from failures of representative selection.
We show that for any $R,\epsilon>0$ and any prime $p\geq 2$, there exists an infinite family of $p$-ary quantum low-density parity-check (QLDPC) codes, rate $R$, checks of weight $O_\epsilon(1)$, and normalized distance at least $\delta_{\mathrm{GV}}(p,R)-\epsilon$. Here, $\delta_{\mathrm{GV}}(p,R)$ denotes the quantum...
The prediction is exact for any unconcatenated stabilizer code, for every logical observable and arbitrary per-qubit error rates, whenever no budget is exhausted, and for concatenated codes, a recursive approach that computes the leading monomial exactly in exponential time is constructed.
Sayam Sethi, Aditi Awasthi, Maxwell Poster et al.· 0 citations
Accurate decoding of quantum low-density parity-check (qLDPC) codes often relies on expensive post-processing search, although decoding difficulty varies strongly between syndromes. We find that the benefit of deeper post-processing search is highly concentrated in a small subset of decoding instances, and that these i...
The results justify the use of BPQM in the decoding step of DQI and of coding-theoretic algorithms based on Regev's reduction whenever the code is drawn from one of the random LDPC ensembles analyzed here and the induced memoryless symmetric pure-state channel lies in the BPQM success region.
Avijit Mandal, C. Piveteau, J. Renes et al.· 3 citations
A soft beam search decoder for quantum low-density parity-check codes that uses internal decoder data as a confidence metric, removing the need for extra computation is introduced.
Arda Aydin, Edwin Tham, Nicolas Delfosse et al.· 3 citations
A quantum-classical separation for Reed-Muller codes punctured at random points is proved, and an efficient classical algorithm under a stronger three-fold multiplication property is given, leaving intermediate regimes as candidates for quantum advantage.
Seyoon Ragavan, N. Shutty· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.