Machine learning message-passing for the scalable decoding of QLDPC codes
Loading...
Access rights
openAccess
CC BY-NC-ND
CC BY-NC-ND
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Unless otherwise stated, all rights belong to the author. You may download, display and print this publication for Your own personal use. Commercial use is prohibited.
Date
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
Series
npj Quantum Information, Volume 11, issue 1
Abstract
We present Astra, a novel and scalable decoder using graph neural networks. In general, Quantum Low Density Parity Check (QLDPC) decoding is based on Belief Propagation (BP, a variant of message-passing) and requires time intensive post-processing methods such as Ordered Statistics Decoding (OSD). Our decoder works on the Tanner graph, similarly to BP. Without using any post-processing, Astra achieves higher thresholds and better Logical Error Rates (LER) compared to BPOSD, both for surface codes trained up to distance 11 and Bivariate Bicycle (BB) codes trained up to distance 18. Moreover, we can successfully extrapolate the decoding functionality: we decode high distances (surface code up to distance 25 and BB code up to distance 34) by using decoders trained on lower distances. Extrapolated Astra achieves better LER than BPOSD for BB codes. Astra(+OSD) achieves orders of magnitude lower logical error rates for BB codes compared to BP(+OSD).Description
Publisher Copyright: © The Author(s) 2025.
Keywords
Other note
Citation
Maan, A S & Paler, A 2025, 'Machine learning message-passing for the scalable decoding of QLDPC codes', npj Quantum Information, vol. 11, no. 1, 78. https://doi.org/10.1038/s41534-025-01033-w