.png){kind=icon}
.png){kind=icon}
Return
Decoding correlated errors in quantum LDPC codes
.png){kind=icon}
OA
AI
DOI：10.1038/s41467-026-70556-3.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise. Our approach is a graph augmentation and rewiring for inference (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. 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 (on par with XYZ-Relay-BP) through ensemble decoding, where 24 randomized normalized min-sum decoders run in parallel on the transformed graph. For the distance 12 Bivariate Bicycle code the logical error rate of (6.70 ± 1.93) × 10−9 is achieved at a 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. Quantum low-density parity-check codes are promising but still miss feasible and reliable general decoding methods. Here, the authors present a decoding graph transformation which results into an accurate, fast, hardware-friendly decoding method for quantum LDPC codes that handles realistic correlated noise while maintaining very low logical error rates.
Keywords:
Applied mathematics
Computer science
Information theory and computation
Science
Humanities and Social Sciences
multidisciplinary
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
15.7
Papers:
9.2W
Citations:
91.2W
View more organizations