高被引论文摘要

高被引论文摘要

被引频次：90

量子计算

夏培肃

近几年来，量子计算机逐渐引起人们的关注。对于计算机科技人员，量子计算机似乎高深莫测。文章是专门为那些不懂量子力学而又想了解量子计算机的计算机工作者而撰写的。介绍了和量子计算有关的术语和符号，并着重阐明一个 n位量子寄存器为何能存储 2n个n位数？量子计算机的一次操作为何能计算所有x的f (x) ?对于解某些问题，量子计算机为何能有惊人的运算速度？除了上面3个问题外，还将介绍基本的量子逻辑门和量子逻辑网络，接着介绍一个量子算法，然后介绍量子计算机的组织结构，最后是讨论，将评价量子计算机的优势和弱点，并讨论量子计算机的物理实现和对量子计算的展望。

量子计算；量子位；量子寄存器；叠加态；纠缠态；干涉；不可克隆性；量子逻辑门；量子并行；大数因子分解Shor量子算法

来源出版物：计算机研究与发展, 2001, 38(10): 1153-1171

被引频次：79

量子信息研究进展

李传锋，郭光灿

摘要：量子信息论是经典信息论与量子力学相结合的新兴交叉学科。本文综述了量子信息领域的研究进展。即包括了为人们所熟知的量子通信与量子计算领域，也包括了刚刚兴起的但却有巨大潜力的量子对策论等领域。本文以介绍量子信息论的基本理论框架为主，同时也介绍了量子信息领域的实验研究进展。

关键词：量子信息；量子通信；量子计算；量子对策论来源出版物：物理学进展, 2000, 20(4): 407-431

被引频次：41

量子计算的进展和展望

周正威，涂涛，龚明，等

摘要：该文主要介绍了量子计算机研究的历史和现状。强调发展大规模的量子计算和实现强关联多体系统的量子模拟，是当前量子计算研究的主流。文章主体部分主要介绍了量子计算机硬件研究方面的进展，主要聚焦于几个具有qubit可集成性的量子系统：量子点系统、超导约瑟夫森结系统、离子阱系统、腔量子电动力学系统，作为实现量子计算机的最主要的候选系统，上述方向的研究吸引了国际上研究量子计算的最主要的力量。我们调研了在这些系统中，在qubit表征、操控方面最具代表性的进展，以及在实现大规模量子计算道路上的困难，和可能的解决办法。

关键词：量子计算；量子模拟；量子点；超导约瑟夫森结；离子阱；腔量子电动力学

来源出版物：物理学进展, 2009 (2): 127-165

被引频次：35

量子计算的研究进展

周正威，黄运锋，张永生

摘要：量子计算由于其强大的并行计算能力和可以有效的模拟量子行为的能力而日益受到人们的关注。本文介绍了量子计算的基本原理、实现量子计算的基本要求、量子计算的根本困难、可能的解决办法，以及当前的几个有希望实现量子计算的物理系统。最后介绍了我们课题组在分布式量子计算和基于固有耦合的编码量子计算的实验与理论方面的工作。

关键词：量子计算；分布量子计算；量子编码；编码量子计算

来源出版物：物理学进展, 2005, 25(4): 368-385

被引频次：31

量子算法与量子计算实验

赵志，冯芒，詹明生

摘要：从量子体系的基本特性出发，介绍了量子计算的基本概念和物理背景，系统阐述了几种主要的量子算法以及量子计算在实验方面的发展现状。对比经典计算机，讨论了量子计算机的优越性、实现量子计算的困难和以期克服的途径。

关键词：量子算法；量子计算；纠缠；相干

来源出版物：物理学进展, 2001, 21(2): 183-215

被引频次：30

量子信息讲座第一讲量子计算机

段路明，郭光灿

摘要：量子力学和计算机理论，这两个看起来互不相关的领域，其结合却产生了一门富于成效的学科：量子计算机．文章介绍了量子计算机的基本概念和历史背景，它相对于经典计算机的优越性，它的构造和实验方案，以及实现量子计算的困难及其克服途径，最后展望了量子计算机的发展前景。

关键词：量子计算机；量子图灵机；量子并行计算；消相干

来源出版物：物理, 1998, 27(1): 53-58

被引频次：26

量子计算与量子计算机

吴楠，宋方敏

摘要：量子计算是一种依照量子力学理论进行的新型计算，量子计算的基础和原理以及重要量子算法为在计算速度上超越图灵机模型提供了可能。在发展与完善量子计算理论的同时，量子计算机的物理实现方案也被不断提出。光子量子计算机，基于核磁共振、离子阱或谐振子等技术的量子计算机物理模型已被逐一实现。近年来亦出现了几个典型的基于量子计算机的量子算法。2001年在一台基于核磁共振技术的量子计算设备上成功演示的 Shor量子算法，显示出量子计算机处理复杂问题的巨大潜能。文章对当前量子计算机物理实现的研究进展进行了综述。

关键词：量子计算；量子计算机；量子算法；体系结构；量子程序设计语言；物理实现

来源出版物：计算机科学与探索, 2011 (1): 1-16

被引频次：22

量子搜索及量子智能优化研究进展

李士勇，李盼池

摘要：为了提高智能优化算法的收敛速度及优化性能，目前国内外将量子计算机制和传统智能优化相融合，研究和提出了多种量子进化算法及量子群智能优化算法；为了进一步推动该领域的研究进展，系统地介绍了国内外提出的多种量子搜索及量子智能优化算法，其中包括量子搜索、量子衍生进化、量子神经网络三个方面内容；总结出目前改进量子搜索算法的主要机制和量子计算与传统智能计算的主要融合方式，并展望了量子搜索和量子智能优化有待进一步研究和需要解决的问题。

关键词：量子计算；量子搜索；量子优化；量子神经网络

来源出版物：计算机测量与控制, 2009 (7): 1239-1242

被引频次：19

量子信息技术

郭光灿

摘要：量子特性在信息领域有着独特的功能，在提高运算速度、确保信息安全、增大信息容量和提高检测精度等方面有望突破现有经典信息系统的极限。量子信息科学正是由量子力学与信息科学相结合的一门学科。近年来量子信息在理论、实验和应用领域都取得重要突破。量子通信在一定程度上已经实现了商业应用并具有广阔的市场应用前景；量子计算机具有目前的计算机从原理上所不可能具有的无与伦比的威力，但目前尚未真正意义上的量子处理器的技术实现，基于量子光学和固态体系的量子处理器的研究大有可为。

来源出版物：重庆邮电大学学报（自然科学版）, 2010, 22(5): 521-525

被引频次：18

量子计算机的发展现状与趋势

郭光灿，周正威，郭国平，等

摘要：量子计算机是一种新型的运算工具，它具有强大的并行处理数据的能力，可解决现有计算机难以运算的数学问题，因此，它成为世界各国战略竞争的焦点。本文综述了量子计算机目前的发展状况和可扩展、可容错的量子计算机物理体系的实验研究进展，并分析了美国最近启动研制量子芯片的微型曼哈顿计划对我国构成的严峻挑战。

关键词：量子信息；量子计算机；量子芯片；微型曼哈顿计划

来源出版物：中国科学院院刊, 2010 (5): 516-524

被引频次：4276

来源出版物：Physical Review A, 1998, 57(1): 120-126

被引频次：2832

A scheme for efficient quantum computation with

linear opticsKnill, E; Laflamme, R; Milburn, GJ

Abstract: Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.

来源出版物：Nature, 2001, 409(6816): 46-52

被引频次：2548

A silicon-based nuclear spin quantum computer

Kane, BE

Abstract: Quantum computers promise to exceed the computational efficiency of ordinary classical machines because quantum algorithms allow the execution of certain tasks in fewer steps. But practical implementation of these machines poses a formidable challenge. Here I present a scheme for implementing a quantum-mechanical computer. Information is encoded onto the nuclear spins of donor atoms In doped silicon electronic devices. Logical operations on individual spins are performed using externally applied electric fields, and spin measurements are made using currents of spin-polarized electrons. The realization of such a computer is dependent on future refinements of conventional silicon electronics.

来源出版物：Nature, 1998, 393(6681): 133-137

被引频次：2179

Quantum computations with cold trapped ions

Cirac, JI; Zoller, P

Abstract: A quantum computer can be implemented with cold ions confined in a linear trap and interacting with laser beams. Quantum gates involving any pair, triplet, or subset of ions can be realized by coupling the ions through the collective quantized motion. In this system decoherence is negligible, and the measurement (readout of the quantum register) can be carried out with a high efficiency.

来源出版物：Physical Review Letters, 1995, 74(20): 4091-4904

被引频次：2037

Polynomial-time algorithms for prime

factorization and discrete logarithms on a quantum computer

Shor, PW

Abstract: A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discretelogarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, for example, the number of digits of the integer to be factored.

关键词：algorithmic number theory; prime factorization; discrete logarithms; Church’s thesis; quantum computers; foundations of quantum mechanics; spin systems; Fourier transforms

来源出版物：SIAM Review, 1999, 41(2): 303-332

被引频次：1861

Fault-tolerant quantum computation by anyons

Kitaev, AY

Abstract: A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in pairs and observing the result of fusion. Such computation is fault-tolerant by its physical nature.

来源出版物：Annals of Physics, 2003, 303(1): 2-30

被引频次：1820

A one-way quantum computer

Raussendorf, R; Briegel, HJ

Abstract: We present a scheme of quantum computation that consists entirely of one-qubit measurements on a particular class of entangled states, the cluster states. The measurements are used to imprint a quantum logic circuit on the state. thereby destroying its entanglement at the same time. Cluster states are thus one-way quantum computers and the measurements form the program.

来源出版物：Physical Review Letters, 2001, 86(22): 5188-5191

被引频次：1604

Elementary gates for quantum computation

Barenco, A; Bennett, CH; Cleve, R; et al.

Abstract: We show that a set of gates that consists of all one-bit quantum gates [U(2)] and the two-bit exclusive-OR gate [that maps Boolean values (x,y) to (x,x⊕y)] is universal in the sense that all unitary operations on arbitrarily many bits n [U(2n)] can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical and of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary n-bit unitary operations.

来源出版物：Physical Review A, 1995, 52(5): 3457-3467

被引频次：1601

Quantum theory, the Church-Turing principle and the universal quantum computer

Deutsch, D

Abstract: It is argued that underlying the Church-Turing hypothesis there is an implicit physical assertion. Here, this assertion is presented explicitly as a physical principle: ‘every finitely realizable physical system can be perfectly simulated by a universal model computing machine operating by finite means’. Classical physics and the universal Turing machine, because the former is continuous and the latter discrete, do not obey the principle, at least in the strong form above. A class of model computing machines that is the quantum generalization of the class of Turing machines is described, and it is shown that quantum theory and the‘universal quantum computer’ are compatible with the principle. Computing machines resembling the universal quantum computer could, in principle, be built and would have many remarkable properties not reproducible by any Turing machine. These do not include the computation of non-recursive functions, but they do include ‘quantum parallelism’, a method by which certain probabilistic tasks can be performed faster by a universal quantum computer than by any classical restriction of it. The intuitive explanation of these properties places an intolerable strain on all interpretations of quantum theory other than Everett’s. Some of the numerous connections between thequantum theory of computation and the rest of physics are explored. Quantum complexity theory allows a physically more reasonable definition of the ‘complexity’ or‘knowledge’ in a physical system than does classical complexity theory.

来源出版物：Proceedings of the Royal Society of London Series A-Mathematical Physical and Engineering Sciences, 1985, 400(1818): 97-117

被引频次：1538

Quantum computing in molecular magnets

Leuenberger, MN; Loss, D

Abstract: Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both superposition and entanglement of a many-particle system, the superposition of single-particle quantum states is sufficient for Grover's algorithm. Recently, the latter has been successfully implemented using Rydberg atoms. Here we propose an implementation of Grover’s algorithm that uses molecular magnets, which are solid-state systems with a large spin; their spin eigenstates make them natural candidates for single-particle systems. We show theoretically that molecular magnets can be used to build dense and efficient memory devices based on the Grover algorithm. In particular, one single crystal can serve as a storage unit of a dynamic random access memory device. Fast electron spin resonance pulses can be used to decode and read out stored numbers of up to 105, with access times as short as 10-10seconds. We show that our proposal should be feasible using the molecular magnets Fe8and Mn12.

来源出版物：Nature, 2001, 410(6830): 789-793

Quantum computation with quantum dots

Loss, D; DiVincenzo, DP

We propose an implementation of a universal set of one- and two-quantum-bit gates for quantum computation using the spin states of coupled singleelectron quantum dots. Desired operations are effected by the gating of the tunneling barrier between neighboring dots. Several measures of the gate quality are computed within a recently derived spin master equation incorporating decoherence caused by a prototypical magnetic environment. Dot-array experiments that would provide an initial demonstration of the desired nonequilibrium spin dynamics are proposed.