本文關(guān)鍵詞：量子算法的一些進(jìn)展　出處：《中國(guó)科學(xué):信息科學(xué)》2017年10期 　論文類(lèi)型：期刊論文

  更多相關(guān)文章： 量子計(jì)算 量子算法 龍算法 對(duì)偶量子計(jì)算

【摘要】：量子計(jì)算機(jī)利用量子力學(xué)原理進(jìn)行計(jì)算,具有量子并行計(jì)算能力,有比經(jīng)典計(jì)算機(jī)更加強(qiáng)大的數(shù)據(jù)處理能力.量子計(jì)算機(jī)可以指數(shù)加速量子體系模擬,加速一些重要的經(jīng)典算法.傳統(tǒng)的量子計(jì)算運(yùn)算是通過(guò)酉算子對(duì)信息進(jìn)行處理,其計(jì)算過(guò)程是對(duì)量子計(jì)算機(jī)體系的初始量子態(tài)進(jìn)行一系列的酉算子的乘積運(yùn)算.20世紀(jì)90年代中期,量子算法取得重大突破,1994年Shor提出了大數(shù)分解量子算法,指數(shù)加快了大數(shù)分解,1996年Grover提出了量子搜索算法,平方根地加速了無(wú)序數(shù)據(jù)庫(kù)的搜索.量子算法的重大突破推動(dòng)量子計(jì)算成為國(guó)際的持續(xù)研究熱點(diǎn)領(lǐng)域.之后量子算法的后續(xù)發(fā)展緩慢,Shor在2003年提出了著名的Shor之問(wèn),詢(xún)問(wèn)為什么沒(méi)有發(fā)現(xiàn)更多的量子算法.2009年以后,多個(gè)重要的新量子算法被發(fā)現(xiàn),如求解線性方程組的量子算法,稀疏Hamiltonian體系的酉算符線性疊加算法,取得計(jì)算精度的指數(shù)改進(jìn)的量子系統(tǒng)的新模擬算法.本文首先簡(jiǎn)單介紹量子算法的基本原理,然后描寫(xiě)Shor算法和Grover/Long搜索算法.這些算法都是傳統(tǒng)的量子算法,計(jì)算的過(guò)程就是一系列酉算子的乘積.接著介紹了2002年提出的對(duì)偶量子計(jì)算,不同于傳統(tǒng)的酉量子算法,對(duì)偶量子算法允許酉算子的線性組合.過(guò)去的量子計(jì)算只能使用酉算子的乘和除,而對(duì)偶量子計(jì)算可以使用酉算子的加減乘除四則運(yùn)算.對(duì)偶量子計(jì)算為構(gòu)造量子算法提供了方便,可以將經(jīng)典算法中的技巧直接用于量子算法的構(gòu)造.我們最近的研究證明2009年以來(lái)的幾個(gè)新量子算法都屬于對(duì)偶量子計(jì)算.本文還介紹開(kāi)放量子系統(tǒng)的對(duì)偶量子模擬算法,該算法不僅降低了計(jì)算復(fù)雜度,而且指數(shù)提高了精度.最后我們給出總結(jié)和展望.
[Abstract]:Quantum computer has the ability of quantum parallel computing and has more powerful data processing ability than classical computer. Quantum computer can accelerate quantum system simulation exponentially. Some important classical algorithms are accelerated. The traditional quantum computation is to process the information by unitary operator. The calculation process is a series of product operations of unitary operator for the initial quantum state of quantum computer system. In the middle of 90s, quantum algorithm made a great breakthrough. In 1994, Shor proposed the quantum algorithm of large number decomposition, exponentially accelerated the large number decomposition, and in 1996, Grover proposed a quantum search algorithm. Square root accelerates the search of unordered database. The great breakthrough of quantum algorithm has promoted quantum computing to become a hot research field in the world. After that, the follow-up development of quantum algorithm has been slow. In 2003, Shor put forward the famous question of Shor, asking why no more quantum algorithms were found. After 2009, several important new quantum algorithms were discovered. For example, the quantum algorithm for solving linear equations, the unitary operator linear superposition algorithm for sparse Hamiltonian system. The new simulation algorithm of exponentially improved quantum system is obtained. Firstly, the basic principle of quantum algorithm is introduced briefly in this paper. Then we describe the Shor algorithm and the Grover/Long search algorithm, which are all traditional quantum algorithms. The process of computing is the product of a series of unitary operators. Then the dual quantum computation proposed in 2002 is different from the traditional unitary quantum algorithm. Dual quantum algorithms allow linear combinations of unitary operators. In the past quantum calculations could only use the multiplication and division of unitary operators. Dual quantum computation can use the addition, subtraction, multiplication and division operation of unitary operator, and dual quantum computation provides convenience for constructing quantum algorithm. The techniques in classical algorithms can be directly used in the construction of quantum algorithms. Our recent studies have proved that several new quantum algorithms since 2009 are dual quantum computation. Even quantum simulation algorithm. The algorithm not only reduces the computational complexity, but also improves the accuracy of the index. Finally, we give a summary and prospect.
【作者單位】： 清華大學(xué)物理系低維量子物理國(guó)家重點(diǎn)實(shí)驗(yàn)室;量子物質(zhì)科學(xué)協(xié)同創(chuàng)新中心;清華信息科學(xué)技術(shù)國(guó)家實(shí)驗(yàn)室(籌);
【基金】：國(guó)家重點(diǎn)基礎(chǔ)研究發(fā)展計(jì)劃(973)(批準(zhǔn)號(hào):2011CB9216002) 國(guó)家重點(diǎn)研發(fā)計(jì)劃(批準(zhǔn)號(hào):2017YFA0303700) 國(guó)家自然科學(xué)基金(批準(zhǔn)號(hào):91221205,11175094)資助項(xiàng)目
【分類(lèi)號(hào)】：TP38
【正文快照】： 1引言量子計(jì)算是國(guó)際上的熱點(diǎn)研究領(lǐng)域,是結(jié)合了計(jì)算機(jī)科學(xué)、數(shù)學(xué)、物理學(xué)和工程技術(shù)等諸多學(xué)科的交叉學(xué)科,具有重要的科學(xué)意義和戰(zhàn)略意義.量子計(jì)算利用量子糾纏、量子干涉等獨(dú)特的量子力學(xué) 原理進(jìn)行計(jì)算.它的主要的研究目標(biāo)是打破傳統(tǒng)的硅芯片電子計(jì)算機(jī)不可避免的發(fā)展極限,

【相似文獻(xiàn)】

相關(guān)期刊論文 前4條

1 霍紅衛(wèi),潘征;大數(shù)質(zhì)因子分解的量子算法[J];計(jì)算機(jī)工程與科學(xué);2003年01期

2 張鎮(zhèn)九;關(guān)于量子算法理論[J];高等函授學(xué)報(bào)(自然科學(xué)版);2000年05期

3 付向群;鮑皖蘇;周淳;鐘普查;;具有高概率的整數(shù)分解量子算法[J];電子學(xué)報(bào);2011年01期

4 魏達(dá)秀,羅軍,孫獻(xiàn)平,曾錫之,楊曉冬,劉買(mǎi)利,丁尚武;七量子位D-J算法和精確受控相移門(mén)的NMR實(shí)驗(yàn)實(shí)現(xiàn)[J];科學(xué)通報(bào);2003年02期

相關(guān)博士學(xué)位論文 前1條

1 徐南陽(yáng);自旋調(diào)控技術(shù)研究及絕熱量子算法的核磁共振實(shí)現(xiàn)[D];中國(guó)科學(xué)技術(shù)大學(xué);2012年

相關(guān)碩士學(xué)位論文 前1條

1 李博;基于量子漫步構(gòu)造的通用量子計(jì)算模型[D];北京郵電大學(xué);2014年

，

本文編號(hào)：1441016