Maximum Likelihood Decoding of Quantum Error Correction Codes

Hanyan Cao, Ge Yan, Yuxuan Du, Feng Pan · 2026 · arXiv

| 编号 QE284 | 主题 译码算法 | 链接 arXiv:2605.17230 |

摘要

摘要保留原文（英文）

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

Quantum error correction (QEC) is indispensable for realizing fault-tolerant quantum computation, yet its effectiveness hinges critically on the classical decoding algorithm that interprets noisy syndrome measurements. Among all possible decoding strategies, maximum likelihood decoding (MLD) is provably optimal, since it identifies the logical group with largest likelihood by summing over all possible errors within logical class consistent with the observed syndrome. Despite its optimality, MLD is computationally intractable in general (#P-hard), motivating a rich landscape of exact and approx

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