Efficient decoding of random errors for quantum expander codes

Omar Fawzi, Antoine Grospellier, Anthony Leverrier · 2017 · STOC 2018

| 编号 QE116 | 主题 qLDPC 码 | 链接 arXiv:1711.08351 |

摘要

摘要保留原文（英文）

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

We show that quantum expander codes, a constant-rate family of quantum LDPC codes, with the quasi-linear time decoding algorithm of Leverrier, Tillich and Zémor can correct a constant fraction of random errors with very high probability. This is the first construction of a constant-rate quantum LDPC code with an efficient decoding algorithm that can correct a linear number of random errors with a negligible failure probability. Finding codes with these properties is also motivated by Gottesman’s construction of fault tolerant schemes with constant space overhead. In order to obtain this result, we study a notion of $\alpha$-percolation: for a random subset $W$ of vertices of a given graph, we con

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