Improved Belief Propagation Decoding Algorithms for Surface Codes
arXiv:2407.11523 · doi:10.1109/TQE.2025.3577769
Abstract
Quantum error correction is crucial for universal fault-tolerant quantum computing. Highly accurate and low-time-complexity decoding algorithms play an indispensable role in ensuring quantum error correction works effectively. Among existing decoding algorithms, belief propagation (BP) is notable for its nearly linear time complexity and general applicability to stabilizer codes. However, BP's decoding accuracy without post-processing is unsatisfactory in most situations. This article focuses on improving the decoding accuracy of BP over GF(4) for surface codes. Inspired by machine learning optimization techniques, we first propose Momentum-BP and AdaGrad-BP to reduce oscillations in message updating, breaking the trapping sets of surface codes. We further propose EWAInit-BP, which adaptively updates initial probabilities and provides a 1 to 3 orders of magnitude improvement over traditional BP for planar surface code, toric code, and XZZX surface code without any post-processing method, showing high decoding accuracy even under parallel scheduling. The theoretical time complexity under parallel implementation and high accuracy of EWAInit-BP make it a promising candidate for high-precision real-time decoders.
References in corpus (28)
- Quantum Error Correction for Quantum Memories
- Suppressing quantum errors by scaling a surface code logical qubit
- Quantum error correction below the surface code threshold
- High-threshold and low-overhead fault-tolerant quantum memory
- Realization of an Error-Correcting Surface Code with Superconducting Qubits
- Quantum Low-Density Parity-Check Codes
- Single-qubit quantum memory exceeding -minute coherence time
- Fast Decoders for Topological Quantum Codes
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- A Neural Decoder for Topological Codes
- Decoding Across the Quantum LDPC Code Landscape
- Neural Belief-Propagation Decoders for Quantum Error-Correcting Codes
- Quantum error correction for the toric code using deep reinforcement learning
- Improved decoding of circuit noise and fragile boundaries of tailored surface codes
- Neural-Network Decoders for Quantum Error Correction using Surface Codes:A Space Exploration of the Hardware Cost-Performance Trade-Offs
- NP-hardness of decoding quantum error-correction codes
- Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
- Scalable Neural Network Decoders for Higher Dimensional Quantum Codes
- Multi-path Summation for Decoding 2D Topological Codes
- Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
- Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
- Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
- Modified belief propagation decoders for quantum low-density parity-check codes
- Neural Network Decoders for Large-Distance 2D Toric Codes
- Log-domain decoding of quantum LDPC codes over binary finite fields
- Generalized Belief Propagation Algorithms for Decoding of Surface Codes
- Quantum XYZ Product Codes
- Comparison of 2D topological codes and their decoding performances