Approximate maximum likelihood decoding with minimum weight matchings
Mao Lin · 2025 · Phys. Rev. A 112, 042436
| 编号 QE264 | 主题 译码算法 | 链接 arXiv:2510.06531 |
摘要
摘要保留原文（英文）
摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。
The minimum weight matching (MWM) and maximum likelihood decoding (MLD) are two widely used and distinct decoding strategies for quantum error correction. For a given syndrome, the MWM decoder finds the most probable physical error corresponding to the MWM of the decoding graph, whereas MLD aims to find the most probable logical error. Although MLD is the optimal error correction strategy, it is typically more computationally expensive compared to the MWM decoder. In this work, we introduce an algorithm that approximates MLD with MWMs from the decoding graph. Taking the surface code subjec
本站词条在引用该文献时，会以 wikilink（sources/QE264）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。