Decoding correlated errors in quantum LDPC codes

Arshpreet Singh Maan et al. · 2025 · Nature Communications

| 编号 QE268 | 主题 译码算法 | 链接 arXiv:2510.14060 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

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.

本站词条在引用该文献时，会以 wikilink（sources/QE268）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。