Degenerate Quantum LDPC Codes With Good Finite Length Performance

Pavel Panteleev, Gleb Kalachev · 2019 · Quantum 5, 585 (2021)

| 编号 QE253 | 主题 译码算法 | 链接 arXiv:1904.02703 |

摘要

摘要保留原文（英文）

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

We study the performance of medium-length quantum LDPC codes in the depolarizing channel. It is shown that with the help of OSD-like postprocessing the performance of the standard belief propagation (BP) decoder on many QLDPC codes can be improved by several orders of magnitude. Using this new BP-OSD decoder we study hypergraph product codes, hyperbicycle codes, homological product codes, and Haah’s cubic codes, and construct several interesting examples of short generalized bicycle codes. The performance of the proposed BP-OSD decoder for some codes is better than for a relatively large surface code decoded by a near-optimal decoder.

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