Resilient Quantum Computation: Error Models and Thresholds

Emanuel Knill, Raymond Laflamme, Wojciech H. Zurek · 1998 · Proc. R. Soc. Lond. A 454, 365

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

摘要

摘要保留原文（英文）

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

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error-correction, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.

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