返回
Basics of quantum computation
DOI:10.1016/S0079-6727(98)00004-4.png)
摘要
En 中文
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 counterpart. 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. (C) 1998 Elsevier Science Ltd. All rights reserved.
Keyword:
ERROR-CORRECTING CODES
REVERSIBLE COMPUTATION
LARGE NUMBERS
TRAPPED IONS
LOGIC GATE
ENTANGLEMENT
COMPUTERS
UNIVERSAL
TIME
COMMUNICATION
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.5
论文数:
293
被引数:
2.1K
机构
暂无机构信息

