Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes
- URL: http://arxiv.org/abs/2310.17758v2
- Date: Mon, 6 Nov 2023 20:44:45 GMT
- Title: Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes
- Authors: Anqi Gong, Sebastian Cammerer, Joseph M. Renes
- Abstract summary: 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.
- Score: 6.175503577352742
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In this work, we propose a fully 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. Both component decoders are defined over the same sparse
decoding graph enabling a seamless integration and scalability to large codes.
The core idea is to use the GNN component between consecutive BP runs, so that
the knowledge from the previous BP run, if stuck in a local minima caused by
trapping sets or short cycles in the decoding graph, can be leveraged to better
initialize the next BP run. By doing so, the proposed decoder can learn to
compensate for sub-optimal BP decoding graphs that result from the design
constraints of quantum LDPC codes. Since the entire decoder remains
differentiable, gradient descent-based training is possible. We compare the
error rate performance of the proposed decoder against various post-processing
methods such as random perturbation, enhanced feedback, augmentation, and
ordered-statistics decoding (OSD) and show that a carefully designed training
process lowers the error-floor significantly. As a result, our proposed decoder
outperforms the former three methods using significantly fewer post-processing
attempts. The source code of our experiments is available online.
Related papers
- Breadth-first graph traversal union-find decoder [0.0]
We develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages.
We show how these methods can be adapted to decode non-topological quantum low-density-parity-check codes.
arXiv Detail & Related papers (2024-07-22T18:54:45Z) - Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
Low-Density Parity-Check codes possess several advantages over other families of codes.
The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
arXiv Detail & Related papers (2024-06-09T12:08:56Z) - 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) - Denoising Diffusion Error Correction Codes [92.10654749898927]
Recently, neural decoders have demonstrated their advantage over classical decoding techniques.
Recent state-of-the-art neural decoders suffer from high complexity and lack the important iterative scheme characteristic of many legacy decoders.
We propose to employ denoising diffusion models for the soft decoding of linear codes at arbitrary block lengths.
arXiv Detail & Related papers (2022-09-16T11:00:50Z) - 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) - Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes [4.340338299803562]
We propose a refined BP decoding algorithm for quantum codes with complexity roughly the same as binary BP.
For a given error syndrome, this algorithm decodes to the same output as the conventional quaternary BP, but the passed node-to-node messages are single-valued.
Message strength normalization can naturally be applied to these single-valued messages to improve the performance.
arXiv Detail & Related papers (2020-02-16T03:51:59Z) - Pruning Neural Belief Propagation Decoders [77.237958592189]
We introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning.
We achieve performance within 0.27 dB and 1.5 dB of the ML performance while reducing the complexity of the decoder.
arXiv Detail & Related papers (2020-01-21T12:05:46Z)
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.