Fault-Tolerant Quantum Computation

Peter W. Shor · 1996 · FOCS 1996, p.56

| 编号 QE004 | 主题 基础理论 | 链接 arXiv:quant-ph/9605011 |

摘要

摘要保留原文（英文）

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

It has recently been realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main dificulties in realizing quantum computation is that decoherence tends to destroy the information in a superposition of states in a quantum computer, making long computations impossible. A further dificulty is that inaccuracies in quantum state transformations throughout the computation accumulate, rendering long computations unreliable. However, these obstacles may not be as formidable as originally believed. For any quantum computation with t gates, we show how to build a polynomial size quantum circuit that tolerates O(1 / log c t) amounts of inaccuracy and decoherence per gate, for some constant c; the previous bound was O(1 /t). We do this by showing that operations can be performed on quantum data encoded by quantum error-correcting codes without decoding this data.

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