Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise
arXiv:2310.12682 · doi:10.1109/TIT.2025.3529773
Abstract
Quantum stabilizer codes often struggle with syndrome errors due to measurement imperfections. Typically, multiple rounds of syndrome extraction are employed to ensure reliable error information. In this paper, we consider phenomenological decoding problems, where data qubit errors may occur between extractions, and each measurement can be faulty. We introduce generalized quantum data-syndrome codes along with a generalized check matrix that integrates both quaternary and binary alphabets to represent diverse error sources. This results in a Tanner graph with mixed variable nodes, enabling the design of belief propagation (BP) decoding algorithms that effectively handle phenomenological errors. Importantly, our BP decoders are applicable to general sparse quantum codes. Through simulations, we achieve an error threshold of more than 3\% for quantum memory protected by rotated toric codes, using solely BP without post-processing. Our results indicate that rounds of syndrome extraction are sufficient for a toric code of distance . We observe that at high error rates, fewer rounds of syndrome extraction tend to perform better, while more rounds improve performance at lower error rates. Additionally, we propose a method to construct effective redundant stabilizer checks for single-shot error correction. Our simulations show that BP decoding remains highly effective even with a high syndrome error rate.
17 pages, 11 figures, 1 table
References in corpus (33)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Topological quantum memory
- Quantum Error Correction for Quantum Memories
- Topological Quantum Distillation
- Topological fault-tolerance in cluster state quantum computation
- Surface code quantum computing by lattice surgery
- Sparse Graph Codes for Quantum Error-Correction
- Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Fast Decoders for Topological Quantum Codes
- Fault-tolerant operation of a logical qubit in a diamond quantum processor
- Decoding Across the Quantum LDPC Code Landscape
- Optimal Resources for Topological 2D Stabilizer Codes: Comparative Study
- Single-shot fault-tolerant quantum error correction
- Detector Tomography on IBM 5-qubit Quantum Computers and Mitigation of Imperfect Measurement
- Fault-tolerant thresholds for quantum error correction with the surface code
- Quantum "hyperbicycle" low-density parity check codes with finite rate
- Fault-tolerant error correction with the gauge color code
- A theory of single-shot error correction for adversarial noise
- Quantum Expander Codes
- Phase Structure of the Random-Plaquette Z_2 Gauge Model: Accuracy Threshold for a Toric Quantum Memory
- Cellular-automaton decoders with provable thresholds for topological codes
- Single-shot error correction of three-dimensional homological product codes
- Combining hard and soft decoders for hypergraph product codes
- Improved single-shot decoding of higher dimensional hypergraph product codes
- Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
- Enhanced Feedback Iterative Decoding of Sparse Quantum Codes
- Exploiting Degeneracy in Belief Propagation Decoding of Quantum Codes
- Ability of stabilizer quantum error correction to protect itself from its own imperfection
- Log-domain decoding of quantum LDPC codes over binary finite fields
- Quantum convolutional data-syndrome codes
- Comparison of 2D topological codes and their decoding performances