Quantum computation
Quantum computation
复制标题
DOI：
10.1007/978-94-011-5886-2_6
复制
发表时间：
1998-12
影响因子：
6.2
通讯作者：
A. Berthiaume
中科院分区：
文献类型：
--
作者：
A. Berthiaume
我们描述了计算物理学如何决定计算复杂性。特别是，我们展示了量子现象如何导致新的计算模式。理想的量子计算机将允许面对经典计算机无法完成的某些任务，因子分解问题是最突出的例子。然而，在实验上，由于与环境的相互作用导致退相干，量子计算的实现面临着一些严重的困难。我们提到量子纠错是一个过程，它可以在某种程度上保护量子计算机免受耗散和退相干的不受欢迎的影响。这是一个简短的，介绍性的审查量子计算。它是基于[1]。
We describe how physics of computation determines computational complexity. In particular we show how quantum phenomena lead to qualitatively new modes of computation. An ideal quantum computer would allow to face certain tasks out of reach of classical computers, the factorization problem being the most striking example. Experimentally, however, implementation of quantum computation faces some serious difficulties due to an interaction with the environment which causes decoherence. We mention quantum error-correction as a process which can, to some extent, protect quantum computers from unwelcome effects of dissipation and decoherence. This is a brief, introductory review of quantum computation. It is based on [1].