A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes
- URL: http://arxiv.org/abs/2401.06874v3
- Date: Sun, 5 May 2024 16:17:37 GMT
- Title: A Joint Code and Belief Propagation Decoder Design for Quantum LDPC Codes
- Authors: Sisi Miao, Jonathan Mandelbaum, Holger Jäkel, Laurent Schmalen,
- Abstract summary: 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.
- Score: 5.194602156761048
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum low-density parity-check (QLDPC) codes are among the most promising candidates for future quantum error correction schemes. However, a limited number of short to moderate-length QLDPC codes have been designed and their decoding performance is sub-optimal with a quaternary belief propagation (BP) decoder due to unavoidable short cycles in their Tanner graphs. In this paper, we propose a novel joint code and decoder design for QLDPC codes. The constructed codes have a minimum distance of about the square root of the block length. In addition, it is, to the best of our knowledge, the first QLDPC code family where BP decoding is not impaired by short cycles of length 4. This is achieved by using an ensemble BP decoder mitigating the influence of assembled short cycles. We outline two code construction methods based on classical quasi-cyclic codes and finite geometry codes. Numerical results demonstrate outstanding decoding performance over depolarizing channels.
Related papers
- 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) - 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) - Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes.
We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47:12Z) - Small Quantum Codes from Algebraic Extensions of Generalized Bicycle
Codes [4.299840769087443]
Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance.
We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
arXiv Detail & Related papers (2024-01-15T10:38:13Z) - 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) - 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) - Spatially-Coupled QDLPC Codes [3.6622737533847936]
We describe toric codes as quantum counterparts of classical spatially-coupled (2D-SC) codes.
We introduce spatially-coupled quantum LDPC (SC-QLDPC) codes as a class of convolutional LDPC codes.
This paper focuses on QLDPC codes with rate less than 1/10, but we construct 2D-SC HGP codes with small memories, higher rates (about 1/3), and superior thresholds.
arXiv Detail & Related papers (2023-04-29T00:57:57Z) - 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) - 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.