Metraipolis › archive › dc_93a14a461fbe
Adaptive decoding of quantum LDPC codes through decoder disagreement — arXiv:2609.37629
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37629
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T19:27:09.083Z
- SHA-256 of the archived text
84cf99c00764e2055b705a7d69b7d04d9662e60c1b00c58b5851b4d6cd9f29e9- Stable URL of this page
https://metraipolis.com/documento/dc_93a14a461fbe
How to cite
Adaptive decoding of quantum LDPC codes through decoder disagreement — arXiv:2609.37629 — arXiv (en), https://arxiv.org/abs/2609.37629 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_93a14a461fbe (Metraipolis archive dc_93a14a461fbe, sha256 84cf99c00764e2055b705a7d69b7d04d9662e60c1b00c58b5851b4d6cd9f29e9)
BibTeX
@misc{dc93a14a461fbe,
title = {Adaptive decoding of quantum LDPC codes through decoder disagreement — arXiv:2609.37629},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37629},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_93a14a461fbe; sha256 84cf99c00764e2055b705a7d69b7d04d9662e60c1b00c58b5851b4d6cd9f29e9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37629. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 instances can be identified directly from the decoder itself. To this end, we introduce an adaptive decoder based on belief propagation (BP) and ordered-statistics decoding (OSD), using the disagreement between the BP hard decision and the syndrome-consistent order-zero OSD solution as an internal risk signal to determine where deeper search is required. On a $[[144,12,12]]$ bivariate bicycle code under circuit-level depolarising noise, encoding $12$ logical qubits in $144$ data qubits with distance $12$, escalating only the highest-risk $20\%$ of instances recovers $85\%$ to $92\%$ of the improvement in logical error rate available from a full one-free-variable sweep, while reducing the mean serial decoding cost by a factor of $3.6$ relative to applying the same truncated search to every instance. At matched budget, disagreement-guided routing also outperforms routing based on the BP syndrome residual, syndrome weight and random selection. The same behaviour reappears on a structurally distinct radial qLDPC code obtained from a lifted-product construction, where escalating $20\%$ of instances recovers $87\%$ to $94\%$ of the available gain. A $Z$-memory experiment on the Quantinuum H2 trapped-ion processor, implementing both $X$-type and $Z$-type checks, further shows that the signal remains predictive under device noise. These results show that decoder-internal disagreement can expose where additional decoding effort is valuable, allowing classical computation to be concentrated on the instances most likely to benefit from it. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-30 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2609.37629 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T18:55:50.609Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).