Modified belief propagation decoders for quantum low-density parity-check codes

Abstract

Quantum low-density parity-check codes can be decoded using a syndrome based $\mathrm{GF}(4)$ belief propagation decoder. However, the performance of this decoder is limited both by unavoidable $4$-cycles in the code's factor graph and the degenerate nature of quantum errors. For the subclass of CSS codes, the number of $4$-cycles can be reduced by breaking an error into an $X$ and $Z$ component and decoding each with an individual $\mathrm{GF}(2)$ based decoder. However, this comes at the expense of ignoring potential correlations between these two error components. We present a number of modified belief propagation decoders that address these issues. We propose a $\mathrm{GF}(2)$ based decoder for CSS codes that reintroduces error correlations by reattempting decoding with adjusted error probabilities. We also propose the use of an augmented decoder, which has previously been suggested for classical binary low-density parity-check codes. This decoder iteratively reattempts decoding on factor graphs that have a subset of their check nodes duplicated. The augmented decoder can be based on a $\mathrm{GF}(4)$ decoder for any code, a $\mathrm{GF}(2)$ decoder for CSS code, or even a supernode decoder for a dual-containing CSS code. For CSS codes, we further propose a $\mathrm{GF}(2)$ based decoder that combines the augmented decoder with error probability adjustment. We demonstrate the performance of these new decoders on a range of different codes, showing that they perform favorably compared to other decoders presented in literature.

arXiv comment22 pages, 29 figures

References in corpus (5)

• Good Quantum Error-Correcting Codes Exist
• Multiple Particle Interference and Quantum Error Correction
• Quantum Error Correction and Orthogonal Geometry
• Sparse Graph Codes for Quantum Error-Correction
• Enhanced Feedback Iterative Decoding of Sparse Quantum Codes

Cited by in corpus (21)

• Degenerate Quantum LDPC Codes With Good Finite Length Performance
• Single-shot error correction of three-dimensional homological product codes
• Trapping Sets of Quantum LDPC Codes
• Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
• Tailoring three-dimensional topological codes for biased noise
• Log-domain decoding of quantum LDPC codes over binary finite fields
• Generalized Belief Propagation Algorithms for Decoding of Surface Codes
• Decoding of Quantum Data-Syndrome Codes via Belief Propagation
• On maximum-likelihood decoding with circuit-level errors
• Improved Belief Propagation Decoding Algorithms for Surface Codes
• Quantum message-passing algorithm for optimal and efficient decoding
• Graph Neural Networks for Enhanced Decoding of Quantum LDPC Codes
• Refined Belief-Propagation Decoding of Quantum Codes with Scalar Messages
• Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices
• On Belief Propagation Decoding of Quantum Codes with Quaternary Reliability Statistics
• Decoherence and Quantum Error Correction for Quantum Computing and Communications
• A blindness property of the Min-Sum decoding for the toric code
• Resource Reduction in Multiplexed High-Dimensional Quantum Reed-Solomon Codes
• Error Correction for Reliable Quantum Computing
• Combinatorial Solution of the Syndrome Decoding Problem using Copula on Grassmann graph
• Optimizing short stabilizer codes for asymmetric channels