On Belief Propagation Decoding of Quantum Codes with Quaternary Reliability Statistics
arXiv:2305.03321 · doi:10.1109/ISTC57237.2023.10273527
Abstract
In this paper, we investigate the use of quaternary reliability statistics for ordered statistics decoding (OSD) of quantum codes. OSD can be used to improve the performance of belief propagation (BP) decoding when it fails to correct the error syndrome. We propose an approach that leverages quaternary reliability information and the hard-decision history output by BP to perform reliability sorting for OSD. This approach improves upon previous methods that separately treat X and Z errors, by preserving the X/Z correlations during the sorting step. Our simulations show that the refined BP with scalar messages and the proposed OSD outperforms previous BP-OSD combinations. We achieve thresholds of roughly 17.5%--17.7% for toric, surface, and XZZX codes, and 15.42% for hexagonal planar color codes.
arXiv comment5 pages, 3 figures, 2 tables (thresholds improved)
References in corpus (24)
- Fault-tolerant quantum computation by anyons
- Good Quantum Error-Correcting Codes Exist
- Stabilizer Codes and Quantum Error Correction
- Topological Quantum Distillation
- Surface code quantum computing by lattice surgery
- Quantum measurements and the Abelian Stabilizer Problem
- Sparse Graph Codes for Quantum Error-Correction
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- The XZZX Surface Code
- Fast Decoders for Topological Quantum Codes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Decoding Across the Quantum LDPC Code Landscape
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- From Majorana Fermions to Topological Order
- Iterative Algebraic Soft-Decision List Decoding of Reed-Solomon Codes
- Single-shot error correction of three-dimensional homological product codes
- Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
- Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
- Improved single-shot decoding of higher dimensional hypergraph product codes
- Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
- Modified belief propagation decoders for quantum low-density parity-check codes
- Low-complexity quantum codes designed via codeword-stabilized framework
- Log-domain decoding of quantum LDPC codes over binary finite fields
- Comparison of 2D topological codes and their decoding performances