Machine Learning Message-Passing for the Scalable Decoding of QLDPC Codes
- URL: http://arxiv.org/abs/2408.07038v2
- Date: Mon, 26 Aug 2024 15:39:03 GMT
- Title: Machine Learning Message-Passing for the Scalable Decoding of QLDPC Codes
- Authors: Arshpreet Singh Maan, Alexandru Paler,
- Abstract summary: We present Astra, a novel and scalable decoder using graph neural networks.
Our decoder works similarly to solving a Sudoku puzzle of constraints represented by the Tanner graph.
- Score: 49.48516314472825
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present Astra, a novel and scalable decoder using graph neural networks. Our decoder works similarly to solving a Sudoku puzzle of constraints represented by the Tanner graph. 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). Without using any post-processing, Astra achieves higher thresholds and better logical error rates when compared to BP+OSD, 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. Astra+OSD is faster than BP+OSD. We show that with decreasing physical error rates, Astra+OSD makes progressively fewer calls to OSD when compared to BP+OSD, even in the context of extrapolated decoding. Astra(+OSD) achieves orders of magnitude lower logical error rates for BB codes compared to BP(+OSD). The source code is open-sourced at \url{https://github.com/arshpreetmaan/astra}.
Related papers
- List Decodable Quantum LDPC Codes [49.2205789216734]
We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff.
We get efficiently list decodable QLDPC codes with unique decoders.
arXiv Detail & Related papers (2024-11-06T23:08:55Z) - Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes [0.0]
We introduce Ambiguity Clustering (AC), an algorithm which seeks to divide measurement data into clusters which are decoded independently.
AC is between one and three orders of magnitude faster than BP-OSD with no reduction in logical fidelity.
Our CPU implementation of AC is already fast enough to decode the 144-qubit Gross code in real time for neutral atom and trapped ion systems.
arXiv Detail & Related papers (2024-06-20T17:39:31Z) - Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation [55.8930142490617]
We propose a decoder for QLDPC codes based on BP guided decimation (BPGD)
BPGD significantly reduces the BP failure rate due to non-convergence.
arXiv Detail & Related papers (2023-12-18T05:58:07Z) - Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes [6.175503577352742]
We propose a differentiable iterative decoder for quantum low-density parity-check (LDPC) codes.
The proposed algorithm is composed of classical belief propagation (BP) decoding stages and intermediate graph neural network (GNN) layers.
arXiv Detail & Related papers (2023-10-26T19:56:25Z) - Boosting Learning for LDPC Codes to Improve the Error-Floor Performance [16.297253625958174]
We propose training methods for neural min-sum (NMS) decoders to eliminate the error-floor effect.
We show that assigning different weights to unsatisfied check nodes effectively lowers the error-floor with a minimal number of weights.
The proposed NMS decoder can be integrated into existing LDPC decoders without incurring extra hardware costs.
arXiv Detail & Related papers (2023-10-11T05:05:40Z) - Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with
Overcomplete Check Matrices [45.997444794696676]
Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers.
One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder.
We first propose to decode QLDPC codes with a belief propagation (BP) decoder operating on overcomplete check matrices.
We extend the neural BP (NBP) decoder, which was originally studied for suboptimal binary BP decoding of QLPDC codes, to quaternary BP decoders.
arXiv Detail & Related papers (2023-08-16T08:24:06Z) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - A Scalable Graph Neural Network Decoder for Short Block Codes [49.25571364253986]
We propose a novel decoding algorithm for short block codes based on an edge-weighted graph neural network (EW-GNN)
The EW-GNN decoder operates on the Tanner graph with an iterative message-passing structure.
We show that the EW-GNN decoder outperforms the BP and deep-learning-based BP methods in terms of the decoding error rate.
arXiv Detail & Related papers (2022-11-13T17:13:12Z) - Graph Neural Networks for Channel Decoding [71.15576353630667]
We showcase competitive decoding performance for various coding schemes, such as low-density parity-check (LDPC) and BCH codes.
The idea is to let a neural network (NN) learn a generalized message passing algorithm over a given graph.
We benchmark our proposed decoder against state-of-the-art in conventional channel decoding as well as against recent deep learning-based results.
arXiv Detail & Related papers (2022-07-29T15:29:18Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.