Decoding Quantum LDPC Codes using Collaborative Check Node Removal

• URL: http://arxiv.org/abs/2501.08036v1
• Date: Tue, 14 Jan 2025 11:41:45 GMT
• Title: Decoding Quantum LDPC Codes using Collaborative Check Node Removal
• Authors: Mainak Bhattacharyya, Ankur Raina,
• Abstract summary: We present a strategy to improve the performance of the iterative decoders based on a collaborative way. We use the concept of bit separation and generalize it to qubit separation. This gives us a metric to analyze and improve the decoder's performance towards harmful configurations of QLDPC codes.
• Score: 0.0
• License:
• Abstract: The fault tolerance of quantum devices requires on-par contributions from error-correcting codes and suitable decoders. One of the most explored error-correcting codes is the family of Quantum Low-Density Parity Check (QLDPC) codes. Although faster than many of the reported decoders for QLDPC codes, iterative decoders fail due to the colossal degeneracy and short cycles intrinsic to these codes. We present a strategy to improve the performance of the iterative decoders based on a collaborative way to use the message passing of the iterative decoders and check node removal from the code's Tanner graph. We use the concept of bit separation and generalize it to qubit separation. This gives us a metric to analyze and improve the decoder's performance towards harmful configurations of QLDPC codes. We present a simple decoding architecture to overcome iterative decoding failures by increasing the separation of trapped qubits without incurring any significant overhead.

Related papers

• 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)
• 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)
• 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)
• 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)
• 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)
• 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)
• 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)
• 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.