Decoding Correlated Errors in Quantum LDPC Codes

Abstract

We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise. The core of our approach is a graph augmentation and rewiring for interference (GARI) method, which modifies the correlated detector error model by eliminating 4-cycles involving Y-type errors, while preserving the equivalence of the decoding problem. We test our approach on the bivariate bicycle codes of distances 6, 10, and 12. A normalized min-sum decoder with a hybrid serial-layered schedule is applied on the transformed graph, achieving high accuracy with low latency. Performance is further enhanced through ensemble decoding, where 24 randomized normalized min-sum decoders run in parallel on the transformed graph, yielding the highest reported accuracy (on par with XYZ-Relay-BP) with unprecedented speed for the tested codes under uniform depolarizing circuit level noise. For the distance 12 (gross) code, our approach yields a logical error rate of $(6.70\pm 1.93)\times 10^{-9}$ at a practical physical error rate of $10^{-3}$. Furthermore, preliminary FPGA implementation results show that such high accuracy can be achieved in real time, with a per-round average decoding latency of 273 ns and sub-microsecond latency in 99.99% of the decoding instances.

15 pages, 7 figures

References in corpus (19)

• Quantum Error Correction for Quantum Memories
• Logical quantum processor based on reconfigurable atom arrays
• Quantum error correction below the surface code threshold
• High-threshold and low-overhead fault-tolerant quantum memory
• Stim: a fast stabilizer circuit simulator
• Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
• Tradeoffs for reliable quantum information storage in 2D systems
• Decoding Across the Quantum LDPC Code Landscape
• Balanced Product Quantum Codes
• Quantum "hyperbicycle" low-density parity check codes with finite rate
• Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress, Challenges and Outlook
• Decoding algorithms for surface codes
• Multi-path Summation for Decoding 2D Topological Codes
• Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Localized statistics decoding for quantum low-density parity-check codes
• Designing fault-tolerant circuits using detector error models
• Improved Belief Propagation Decoding Algorithms for Surface Codes
• Check-Agnosia based Post-Processor for Message-Passing Decoding of Quantum LDPC Codes