Quantum Expander Codes

Anthony Leverrier, Jean-Pierre Tillich, Gilles Zémor · 2015 · IEEE 56th FOCS 2015, 810-824

| 编号 QE056 | 主题 经典编码基础 | 链接 arXiv:1504.00822 |

摘要

摘要保留原文（英文）

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

We present an efficient decoding algorithm for constant rate quantum hypergraph-product LDPC codes which provably corrects adversarial errors of weight Omega(sqrt(n)) for codes of length n. The algorithm runs in time linear in the number of qubits, which makes its performance the strongest to date for linear-time decoding of quantum codes. The algorithm relies on expanding properties, not of the quantum code’s factor graph directly, but of the factor graph of the original classical code it is constructed from.

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