Fault-Tolerant Quantum Computation with Constant Overhead

Daniel Gottesman · 2013 · arXiv (2013, 未期刊发表)

| 编号 QE115 | 主题 qLDPC 码 | 链接 arXiv:1310.2984 |

摘要

摘要保留原文（英文）

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

What is the minimum number of extra qubits needed to perform a large fault-tolerant quantum circuit? Working in a common model of fault-tolerance, I show that in the asymptotic limit of large circuits, the ratio of physical qubits to logical qubits can be a constant. The construction makes use of quantum low-density parity check codes, and the asymptotic overhead of the protocol is equal to that of the family of quantum error-correcting codes underlying the fault-tolerant protocol.

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