arXiv cs.AI· Hee-Youl Kwak, Seong-Joon Park, Hyunwoo Jung, Jeongseok Ha, Jae-Won Kim·· 13 小时前AI 评分22
进化式 BP+OSD 解码：面向低延迟量子纠错的新方案
Evolutionary BP+OSD Decoding for Low-Latency Quantum Error Correction
AI 导读
研究者提出进化式 BP（EBP）解码器，用差分进化算法对 EBP+OSD 结构做端到端优化，并引入多目标选择规则抑制频繁触发 OSD，从而降低复杂度开销。在 surface code 与 QLDPC 码上的仿真显示，EBP+OSD 在低延迟场景下同时实现优于传统 BP+OSD 的解码性能与显著更低的复杂度。
正文 · 原文
Abstract:Quantum error correction (QEC) for fault-tolerant quantum computing requires a balanced decoding solution that offers high performance, low complexity, and low latency. However, the de facto standard - belief propagation (BP) combined with ordered statistics decoding (OSD) - suffers from excessive iterations in the BP stage and high complexity in the OSD stage. To address these challenges, we propose an evolutionary BP (EBP) decoder optimized via a differential evolution (DE) algorithm. By leveraging the gradient-free nature of DE, we enable end-to-end optimization of the EBP+OSD structure to maximize overall performance. In addition, a multi-objective selection rule is introduced to suppress frequent OSD activation, significantly reducing complexity overhead. Simulation results on surface codes and quantum low-density parity-check (QLDPC) codes demonstrate that EBP+OSD simultaneously achieves both superior decoding performance and substantially lower complexity compared to conventional BP+OSD, particularly in stringent low-latency regimes.
| Comments: | 13 pages, 10 figures |
| Subjects: | Quantum Physics (quant-ph); Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2512.18273 [quant-ph] |
| (or arXiv:2512.18273v3 [quant-ph] for this version) | |
| https://doi.org/10.48550/arXiv.2512.18273 arXiv-issued DOI via DataCite |
Submission history
From: Hee-Youl Kwak [view email]
[v1]
Sat, 20 Dec 2025 08:29:43 UTC (419 KB)
[v2]
Fri, 1 May 2026 06:57:29 UTC (562 KB)
[v3]
Wed, 21 Oct 2026 11:59:47 UTC (1,100 KB)
来源：arXiv cs.AI · arxiv.org