Sparse-Blossom Decoding in $o(1)$ Time

Ryo Mikami, Hayata Yamasaki · 2026 · arXiv

| 编号 QE291 | 主题 译码算法 | 链接 arXiv:2609.12262 |

摘要

摘要保留原文（英文）

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

Matching-based decoding is widely used in quantum error correction, and accelerating it is key to enabling fast and scalable fault-tolerant quantum computation. Minimum-weight perfect matching (MWPM) decoding provides rigorous guarantees for error suppression, while sparse blossom enables its practical implementation at modest problem sizes. However, the runtime of existing sparse-blossom implementations unavoidably increases with problem size, motivating a rigorous parallelization framework that guarantees correctness and a runtime shorter than the syndrome-extraction timescale. Here, we pres

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