Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with
Overcomplete Check Matrices
- URL: http://arxiv.org/abs/2308.08208v1
- Date: Wed, 16 Aug 2023 08:24:06 GMT
- Title: Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with
Overcomplete Check Matrices
- Authors: Sisi Miao, Alexander Schnerring, Haizheng Li, and Laurent Schmalen
- Abstract summary: 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.
- Score: 45.997444794696676
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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. In this work, we first propose to decode QLDPC codes with a belief
propagation (BP) decoder operating on overcomplete check matrices. Then, we
extend the neural BP (NBP) decoder, which was originally studied for suboptimal
binary BP decoding of QLPDC codes, to quaternary BP decoders. Numerical
simulation results demonstrate that both approaches as well as their
combination yield a low-latency, high-performance decoder for several short to
moderate length QLDPC codes.
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) - Decoding Quantum LDPC Codes Using Graph Neural Networks [52.19575718707659]
We propose a novel decoding method for Quantum Low-Density Parity-Check (QLDPC) codes based on Graph Neural Networks (GNNs)
The proposed GNN-based QLDPC decoder exploits the sparse graph structure of QLDPC codes and can be implemented as a message-passing decoding algorithm.
arXiv Detail & Related papers (2024-08-09T16:47:49Z) - Collective Bit Flipping-Based Decoding of Quantum LDPC Codes [0.6554326244334866]
We improve both the error correction performance and decoding latency of variable degree-3 (dv-3) QLDPC codes under iterative decoding.
Our decoding scheme is based on applying a modified version of bit flipping (BF) decoding, namely two-bit bit flipping (TBF) decoding.
arXiv Detail & Related papers (2024-06-24T18:51:48Z) - A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes [5.194602156761048]
We propose a novel joint code and decoder design for QLDPC codes.
Joint codes have a minimum distance of about the square root of the block length.
Results demonstrate outstanding decoding performance over depolarizing channels.
arXiv Detail & Related papers (2024-01-12T20:07:16Z) - 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) - Testing the Accuracy of Surface Code Decoders [55.616364225463066]
Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC)
This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
arXiv Detail & Related papers (2023-11-21T10:22:08Z) - 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) - Toward a Union-Find decoder for quantum LDPC codes [0.0]
We propose a generalization of the Union-Find decoder as adecoder for quantum LDPC codes.
We prove that this decoder corrects all errors with weight up to Analpha for some A, alpha > 0 for different classes of quantum LDPC codes.
arXiv Detail & Related papers (2021-03-14T21:55:48Z)
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.