arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9802065quant-ph
收藏

量子计算基础

Basics of Quantum Computation

Vlatko Vedral, Martin B. Plenio

摘要:

量子计算机需要量子逻辑,这与经典的布尔逻辑有着根本的不同。这种差异导致量子计算的效率高于经典计算。在这篇综述中,我们解释了量子计算的基本原理,包括基本门和网络的构建。我们说明了权力的量子算法使用简单的问题的Deutsch,并解释,再次在非常简单的条款,众所周知的算法肖尔因式分解的大量素数。然后,我们描述了量子计算机的物理实现,特别关注一个,线性离子阱实现。我们解释说,建立一个实际的量子计算机的主要障碍是退相干的问题,我们表明,可以绕过使用量子纠错的方法。

英文摘要:

Quantum computers require quantum logic, something fundamentally different to classical Boolean logic. This difference leads to a greater efficiency of quantum computation over its classical counter-part. In this review we explain the basic principles of quantum computation, including the construction of basic gates, and networks. We illustrate the power of quantum algorithms using the simple problem of Deutsch, and explain, again in very simple terms, the well known algorithm of Shor for factorisation of large numbers into primes. We then describe physical implementations of quantum computers, focusing on one in particular, the linear ion-trap realization. We explain that the main obstacle to building an actual quantum computer is the problem of decoherence, which we show may be circumvented using the methods of quantum error correction.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑