首页 | 本学科首页   官方微博 | 高级检索  
     

量子计算
引用本文:夏培肃.量子计算[J].计算机研究与发展,2001,38(10):1153-1171.
作者姓名:夏培肃
作者单位:中国科学院计算技术研究所
摘    要:近几年来,量子计算机逐渐引起人们的关注。对于计算机科技人员,量子计算机似乎高深莫测。文章是专门为那些不懂量子力学而又想了解量子计算机的计算机工作者撰写的。介绍了和量子计算有关的术语和符号,并着重阐明一个n位量子寄存器为何能存储2^n个n位数?量子计算机的一次操作为何能计算所有x的f(x)?对于解栽些问题,量子计算机为何能有惊人的运算速度?除了上面3个问题外,还将介绍基本的量子逻辑门和量子逻辑网络,接着介绍一个量子算法,然后介绍量子计算机的组织结构,最后是讨论,将评价量子计算机的优势和弱点,并讨论量子计算机的物理实现和对量子计算的展望。

关 键 词:量子计算  量子位  量子力学  量子计算机

QUANTUM COMPUTING
XIA Pei-Su.QUANTUM COMPUTING[J].Journal of Computer Research and Development,2001,38(10):1153-1171.
Authors:XIA Pei-Su
Abstract:This paper is written for those computer scientists and computer engineers who are interested in quantum computing but know little about quantum mechanics. The technical terms and symbols of quantum computing are first introduced. The questions of why an n bit quantum register can store 2 n n bit numbers, why quantum computer can compute f(x) of all x by one operation, and why a quantum computer can solve some problems with astonishing speed, are clarified. Quantum logical gates and quantum logical networks, Shor's quantum algorithm for large number factorization, and the architecture of quantum computers are presented in succession. Finally, the strength and weakness, the physical implementation and the perspective of quantum computers are discussed.
Keywords:quantum computing  qubit  quantum register  superposed state  entangled state  interference  nonclonability  quantum logical gate  quantum parallelism  Shor's quantum algorithm for large number factorization
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号