Degenerate quantum erasure decoding

Kao-Yueh Kuo and Yingkai Ouyang · 2024 · npj Quantum Information

| 编号 QE261 | 主题 译码算法 | 链接 arXiv:2411.13509 |

摘要

摘要保留原文（英文）

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

Abstract Erasures are the primary type of errors in physical systems dominated by leakage errors. While quantum error correction (QEC) using stabilizer codes can combat erasure errors, it remains unknown which constructions achieve capacity performance. If such codes exist, decoders with linear runtime in the code length are also desired. In this paper, we present erasure capacity-achieving quantum codes under maximum-likelihood decoding (MLD), though MLD requires cubic runtime in the code length. For QEC, using an accurate decoder with the shortest possible runtime will minimize the degradation of quantum information while awaiting the decoder’s decision. To address this, we propose belief propagation (BP) decoders that run in linear time and exploit error degeneracy in stabilizer codes, achieving capacity or near-capacity performance for a broad class of codes, including bicycle codes, product codes, and topological codes. We furthermore explore the potential of our BP decoders to handle mixed erasure and depolarizing errors, and also local deletion errors via concatenation with permutation invariant codes.

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