量子計(jì)算機(jī)

·編者按·

量子計(jì)算機(jī)，是一種遵循量子力學(xué)規(guī)律進(jìn)行高速數(shù)學(xué)和邏輯運(yùn)算、存儲(chǔ)及處理量子信息的物理裝置。量子計(jì)算用來存儲(chǔ)數(shù)據(jù)的載體是量子比特，它使用量子算法來進(jìn)行數(shù)據(jù)操作。20世紀(jì)80年代，量子計(jì)算作為一個(gè)新的學(xué)科方向誕生，源于量子力學(xué)和計(jì)算機(jī)科學(xué)與技術(shù)的結(jié)合。雖然量子計(jì)算最初是為了解決物理問題提出的，但隨著量子計(jì)算的理論和實(shí)驗(yàn)技術(shù)的發(fā)展，量子計(jì)算和量子計(jì)算機(jī)受到了計(jì)算機(jī)科學(xué)與技術(shù)領(lǐng)域的廣泛關(guān)注。量子計(jì)算理論表明，量子計(jì)算機(jī)具有比電子計(jì)算機(jī)更強(qiáng)的計(jì)算能力。目前，量子計(jì)算機(jī)實(shí)現(xiàn)面臨著退相干帶來的一系列困難，以及一些技術(shù)上的問題。據(jù)悉，中國科學(xué)家已經(jīng)能夠?qū)瘟Ｗ雍土孔討B(tài)進(jìn)行調(diào)控，開始從“觀測(cè)時(shí)代”走向“調(diào)控時(shí)代”，量子計(jì)算機(jī)的實(shí)現(xiàn)值得期待。

本專題得到郭光燦院士（中國科學(xué)技術(shù)大學(xué)）、李傳鋒教授（中國科學(xué)技術(shù)大學(xué)）、張煥國教授（武漢大學(xué)）、張洪濤教授（湖北工業(yè)大學(xué)）的大力支持。

·熱點(diǎn)數(shù)據(jù)排行·

截至2017年 4月 17日，中國知網(wǎng)（CNKI）和Web of Science（WOS）的數(shù)據(jù)報(bào)告顯示，以“量子計(jì)算機(jī)”為詞條可以檢索到的期刊文獻(xiàn)分別為1572、 3393條，本專題將相關(guān)數(shù)據(jù)按照：研究機(jī)構(gòu)發(fā)文數(shù)、作者發(fā)文數(shù)、期刊發(fā)文數(shù)、被引用頻次進(jìn)行排行，結(jié)果如下。

研究機(jī)構(gòu)發(fā)文數(shù)量排名（CNKI）

研究機(jī)構(gòu)發(fā)文數(shù)量排名（WOS）

作者發(fā)文數(shù)量排名（CNKI）

作者發(fā)文數(shù)量排名（WOS）

作者發(fā)文數(shù)量排名（CNKI）（續(xù)表）

作者發(fā)文數(shù)量排名（WOS）（續(xù)表）

期刊發(fā)文數(shù)量排名（CNKI）

期刊發(fā)文數(shù)量排名（WOS）

根據(jù)中國知網(wǎng)（CNKI）數(shù)據(jù)報(bào)告，以“量子計(jì)算機(jī)”等為詞條可以檢索到的高被引論文排行結(jié)果如下。

國內(nèi)數(shù)據(jù)庫高被引論文排行

根據(jù)Web of Science統(tǒng)計(jì)數(shù)據(jù)，以“量子計(jì)算機(jī)”為詞條可以檢索到的高被引論文排行結(jié)果如下。

國外數(shù)據(jù)庫高被引論文排行

·經(jīng)典文獻(xiàn)推薦·

基于Web of Science檢索結(jié)果，利用Histcite軟件選取 LCS（Local Citation Score，本地引用次數(shù)）TOP 30文獻(xiàn)作為節(jié)點(diǎn)進(jìn)行分析，得到本領(lǐng)域推薦的經(jīng)典文獻(xiàn)如下。

Abstract: Over the past several decades, quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit unique quantum properties? Today it is understood that the answer is yes, and many research groups around the world are working towards the highly ambitious technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for quantum computation. However, it remains unclear which technology, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain the major challenges for the future.

來源出版物：Nature, 2010, 464, 45-53

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

Deutsch, D

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 the quantum 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

Rapid solution of problems by quantum computation

Deutsch, D; Jozsa, R

Abstract: A class of problems is described which can be solved more efficiently by quantum computation than by any classical or stochastic method. The quantum computation solves the problem with certainty in exponentially less time than any classical deterministic computation.

來源出版物：Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences. The Royal Society, 1992, 439(1907): 553-558

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

Quantum computation and Shor’s factoring algorithm

Ekert, A; Jozsa, R

Abstract: Current technology is beginning to allow us to manipulate rather than just observe individual quantum phenomena. This opens up the possibility of exploiting quantum effects to perform computations beyond the scope of any classical computer. Recently Peter Shor discovered an efficient algorithm for factoring whole numbers, which uses characteristically quantum effects. The algorithm illustrates the potential power of quantum computation, as there is no known efficient classical method for solving this problem. The authors give an exposition of Shor’s algorithm together with an introduction to quantum computation and complexity theory. They discuss experiments that may contribute to its practical implementation.

來源出版物：Reviews of Modern Physics, 1996, 68 (3): 733-753

Quantum computers

Ladd, TD; Jelezko, F; Laflamme, R; et al.

典

1 2 3 4 5文章題目Quantum theory, the Church-Turing principle and the universal quantum computer Rapid solution of problems by quantum computation Elementary gates for quantum computation Quantum computation and Shor's factoring algorithm Quantum computers第一作者Deutsch, D Deutsch, D Barenco, A Ekert, A Ladd, TD來源出版物Proceedings of the Royal Society of London Series A-Mathematical Physical and Engineering Sciences, 1985, 400(1818): 97-117 Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences. The Royal Society, 1992, 439(1907): 553-558 Physical Review A, 1995, 52(5): 3457-3467 Reviews of Modern Physics, 1996, 68 (3): 733-753 Nature, 2010, 464, 45-53