aiqbench analysis
This research presents a generalized low-density parity-check decoding framework for quantum Tanner codes using soft-output guessing random additive noise decoding (SOGRAND). By decoding entire component codes rather than individual checks, the method significantly mitigates trapping sets and cycles, achieving logical error rate improvements of over two orders of magnitude compared to standard baselines. This advancement offers a scalable path forward for decoding emerging classes of quantum codes compatible with existing belief propagation enhancements.
Efficient Soft-Output Guessing for Enhanced Quantum Tanner Code Decoding
arXiv:2603.18318v2 Announce Type: replace Abstract: We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-output decoding entire component codes rather than individual parity checks, we mitigate the effects of trapping sets and cycles, resulting in improved convergence. Because our decoder preserves the message passing structure of standard belief propagation (BP), it is compatible with many BP enhancements. We demonstrate this with OSD postprocessing, quaternary BP, and RelayBP, each yielding further gains. Standalone SOGRAND outperforms the standard BP+OSD baseline by over two orders of magnitude in logical error rate. In combination with the Relay principle, SOGRAND outperforms RelayBP by over one order of magnitude, providing a way forward for scalable decoding of the emerging class of Tanner-code-based quantum codes.
Abstract:We introduce a generalized low-density parity-check decoding framework for quantum Tanner codes utilizing soft-output guessing random additive noise decoding (SOGRAND). By soft-output decoding entire component codes rather than individual parity checks, we mitigate the effects of trapping sets and cycles, resulting in improved convergence. Because our decoder preserves the message passing structure of standard belief propagation (BP), it is compatible with many BP enhancements. We demonstrate this with OSD postprocessing, quaternary BP, and RelayBP, each yielding further gains. Standalone SOGRAND outperforms the standard BP+OSD baseline by over two orders of magnitude in logical error rate. In combination with the Relay principle, SOGRAND outperforms RelayBP by over one order of magnitude, providing a way forward for scalable decoding of the emerging class of Tanner-code-based quantum codes.
Quantum Physics (quant-ph); Information Theory (cs.IT)
arXiv:2603.18318 [quant-ph]
(or arXiv:2603.18318v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2603.18318 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 220 words
Related coverage

Entanglement-assisted Quasi-cyclic Quantum Low-density Parity-check Codes over Qubits
Quantum Journal · Jul 31, 2026

Humanity’s Last Invention — Richard Socher of Recursive
Latent Space · Sep 14, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026

NVIDIA speeds up financial clustering with GPU factorization
Quantum Zeitgeist · Sep 5, 2026