高被引論文摘要

高被引論文摘要

被引頻次：90

量子計算

夏培肅

近幾年來，量子計算機逐漸引起人們的關(guān)注。對于計算機科技人員，量子計算機似乎高深莫測。文章是專門為那些不懂量子力學(xué)而又想了解量子計算機的計算機工作者而撰寫的。介紹了和量子計算有關(guān)的術(shù)語和符號，并著重闡明一個 n位量子寄存器為何能存儲 2n個n位數(shù)？量子計算機的一次操作為何能計算所有x的f (x) ?對于解某些問題，量子計算機為何能有驚人的運算速度？除了上面3個問題外，還將介紹基本的量子邏輯門和量子邏輯網(wǎng)絡(luò)，接著介紹一個量子算法，然后介紹量子計算機的組織結(jié)構(gòu)，最后是討論，將評價量子計算機的優(yōu)勢和弱點，并討論量子計算機的物理實現(xiàn)和對量子計算的展望。

量子計算；量子位；量子寄存器；疊加態(tài)；糾纏態(tài)；干涉；不可克隆性；量子邏輯門；量子并行；大數(shù)因子分解Shor量子算法

來源出版物：計算機研究與發(fā)展, 2001, 38(10): 1153-1171

被引頻次：79

量子信息研究進(jìn)展

李傳鋒，郭光燦

摘要：量子信息論是經(jīng)典信息論與量子力學(xué)相結(jié)合的新興交叉學(xué)科。本文綜述了量子信息領(lǐng)域的研究進(jìn)展。即包括了為人們所熟知的量子通信與量子計算領(lǐng)域，也包括了剛剛興起的但卻有巨大潛力的量子對策論等領(lǐng)域。本文以介紹量子信息論的基本理論框架為主，同時也介紹了量子信息領(lǐng)域的實驗研究進(jìn)展。

關(guān)鍵詞：量子信息；量子通信；量子計算；量子對策論來源出版物：物理學(xué)進(jìn)展, 2000, 20(4): 407-431

被引頻次：41

量子計算的進(jìn)展和展望

周正威，涂濤，龔明，等

摘要：該文主要介紹了量子計算機研究的歷史和現(xiàn)狀。強調(diào)發(fā)展大規(guī)模的量子計算和實現(xiàn)強關(guān)聯(lián)多體系統(tǒng)的量子模擬，是當(dāng)前量子計算研究的主流。文章主體部分主要介紹了量子計算機硬件研究方面的進(jìn)展，主要聚焦于幾個具有qubit可集成性的量子系統(tǒng)：量子點系統(tǒng)、超導(dǎo)約瑟夫森結(jié)系統(tǒng)、離子阱系統(tǒng)、腔量子電動力學(xué)系統(tǒng)，作為實現(xiàn)量子計算機的最主要的候選系統(tǒng)，上述方向的研究吸引了國際上研究量子計算的最主要的力量。我們調(diào)研了在這些系統(tǒng)中，在qubit表征、操控方面最具代表性的進(jìn)展，以及在實現(xiàn)大規(guī)模量子計算道路上的困難，和可能的解決辦法。

關(guān)鍵詞：量子計算；量子模擬；量子點；超導(dǎo)約瑟夫森結(jié)；離子阱；腔量子電動力學(xué)

來源出版物：物理學(xué)進(jìn)展, 2009 (2): 127-165

被引頻次：35

量子計算的研究進(jìn)展

周正威，黃運鋒，張永生

摘要：量子計算由于其強大的并行計算能力和可以有效的模擬量子行為的能力而日益受到人們的關(guān)注。本文介紹了量子計算的基本原理、實現(xiàn)量子計算的基本要求、量子計算的根本困難、可能的解決辦法，以及當(dāng)前的幾個有希望實現(xiàn)量子計算的物理系統(tǒng)。最后介紹了我們課題組在分布式量子計算和基于固有耦合的編碼量子計算的實驗與理論方面的工作。

關(guān)鍵詞：量子計算；分布量子計算；量子編碼；編碼量子計算

來源出版物：物理學(xué)進(jìn)展, 2005, 25(4): 368-385

被引頻次：31

量子算法與量子計算實驗

趙志，馮芒，詹明生

摘要：從量子體系的基本特性出發(fā)，介紹了量子計算的基本概念和物理背景，系統(tǒng)闡述了幾種主要的量子算法以及量子計算在實驗方面的發(fā)展現(xiàn)狀。對比經(jīng)典計算機，討論了量子計算機的優(yōu)越性、實現(xiàn)量子計算的困難和以期克服的途徑。

關(guān)鍵詞：量子算法；量子計算；糾纏；相干

來源出版物：物理學(xué)進(jìn)展, 2001, 21(2): 183-215

被引頻次：30

量子信息講座第一講量子計算機

段路明，郭光燦

摘要：量子力學(xué)和計算機理論，這兩個看起來互不相關(guān)的領(lǐng)域，其結(jié)合卻產(chǎn)生了一門富于成效的學(xué)科：量子計算機．文章介紹了量子計算機的基本概念和歷史背景，它相對于經(jīng)典計算機的優(yōu)越性，它的構(gòu)造和實驗方案，以及實現(xiàn)量子計算的困難及其克服途徑，最后展望了量子計算機的發(fā)展前景。

關(guān)鍵詞：量子計算機；量子圖靈機；量子并行計算；消相干

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

被引頻次：26

量子計算與量子計算機

吳楠，宋方敏

摘要：量子計算是一種依照量子力學(xué)理論進(jìn)行的新型計算，量子計算的基礎(chǔ)和原理以及重要量子算法為在計算速度上超越圖靈機模型提供了可能。在發(fā)展與完善量子計算理論的同時，量子計算機的物理實現(xiàn)方案也被不斷提出。光子量子計算機，基于核磁共振、離子阱或諧振子等技術(shù)的量子計算機物理模型已被逐一實現(xiàn)。近年來亦出現(xiàn)了幾個典型的基于量子計算機的量子算法。2001年在一臺基于核磁共振技術(shù)的量子計算設(shè)備上成功演示的 Shor量子算法，顯示出量子計算機處理復(fù)雜問題的巨大潛能。文章對當(dāng)前量子計算機物理實現(xiàn)的研究進(jìn)展進(jìn)行了綜述。

關(guān)鍵詞：量子計算；量子計算機；量子算法；體系結(jié)構(gòu)；量子程序設(shè)計語言；物理實現(xiàn)

來源出版物：計算機科學(xué)與探索, 2011 (1): 1-16

被引頻次：22

量子搜索及量子智能優(yōu)化研究進(jìn)展

李士勇，李盼池

摘要：為了提高智能優(yōu)化算法的收斂速度及優(yōu)化性能，目前國內(nèi)外將量子計算機制和傳統(tǒng)智能優(yōu)化相融合，研究和提出了多種量子進(jìn)化算法及量子群智能優(yōu)化算法；為了進(jìn)一步推動該領(lǐng)域的研究進(jìn)展，系統(tǒng)地介紹了國內(nèi)外提出的多種量子搜索及量子智能優(yōu)化算法，其中包括量子搜索、量子衍生進(jìn)化、量子神經(jīng)網(wǎng)絡(luò)三個方面內(nèi)容；總結(jié)出目前改進(jìn)量子搜索算法的主要機制和量子計算與傳統(tǒng)智能計算的主要融合方式，并展望了量子搜索和量子智能優(yōu)化有待進(jìn)一步研究和需要解決的問題。

關(guān)鍵詞：量子計算；量子搜索；量子優(yōu)化；量子神經(jīng)網(wǎng)絡(luò)

來源出版物：計算機測量與控制, 2009 (7): 1239-1242

被引頻次：19

量子信息技術(shù)

郭光燦

摘要：量子特性在信息領(lǐng)域有著獨特的功能，在提高運算速度、確保信息安全、增大信息容量和提高檢測精度等方面有望突破現(xiàn)有經(jīng)典信息系統(tǒng)的極限。量子信息科學(xué)正是由量子力學(xué)與信息科學(xué)相結(jié)合的一門學(xué)科。近年來量子信息在理論、實驗和應(yīng)用領(lǐng)域都取得重要突破。量子通信在一定程度上已經(jīng)實現(xiàn)了商業(yè)應(yīng)用并具有廣闊的市場應(yīng)用前景；量子計算機具有目前的計算機從原理上所不可能具有的無與倫比的威力，但目前尚未真正意義上的量子處理器的技術(shù)實現(xiàn)，基于量子光學(xué)和固態(tài)體系的量子處理器的研究大有可為。

來源出版物：重慶郵電大學(xué)學(xué)報（自然科學(xué)版）, 2010, 22(5): 521-525

被引頻次：18

量子計算機的發(fā)展現(xiàn)狀與趨勢

郭光燦，周正威，郭國平，等

摘要：量子計算機是一種新型的運算工具，它具有強大的并行處理數(shù)據(jù)的能力，可解決現(xiàn)有計算機難以運算的數(shù)學(xué)問題，因此，它成為世界各國戰(zhàn)略競爭的焦點。本文綜述了量子計算機目前的發(fā)展?fàn)顩r和可擴展、可容錯的量子計算機物理體系的實驗研究進(jìn)展，并分析了美國最近啟動研制量子芯片的微型曼哈頓計劃對我國構(gòu)成的嚴(yán)峻挑戰(zhàn)。

關(guān)鍵詞：量子信息；量子計算機；量子芯片；微型曼哈頓計劃

來源出版物：中國科學(xué)院院刊, 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.

關(guān)鍵詞：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.