期刊文献+

绝热量子搜索算法中的纠缠与能量分析 被引量:1

Entanglement Versus Energy in Adiabatic Quantum Search Algorithms
下载PDF
导出
摘要 为了进一步研究量子纠缠与量子计算速度及能量的关系,通过计算von Neumann纠缠熵,分析了时间复杂度分别为O(N^(1/2))和O(1)的绝热量子搜索算法的量子纠缠度随时间的变化关系,并对两者进行了比较.实验结果表明,量子纠缠对绝热量子计算的运行时间具有明显的影响,较大的纠缠可以导致更短的运行时间,反之亦然.同时对纠缠与能量的关系给出了一般性解释,即注入能量导致系统的纠缠增大,并因此缩短算法的运行时间.此外还分析了纠缠与量子系统初态的关系.实验表明系统初态形式不同,其纠缠度也不一样.初态为等幅叠加态的算法涉及的纠缠度明显大于初态为非等幅叠加态的算法. This paper is concerned with the role of entanglement in speeding up of quantum algorithms as well as its effect of energy on entanglement. To this end, based on the von Neumann entropy, the evolution of entanglement is investigated with respect to time in adiabatic quantum search algorithms with complexity O(N^(1/2) ) and O(1), respectively, and the comparison between them are made accordingly. The analysis results support the point that entanglement impact significantly on the computational efficiency of both of the algorithms. That is, the greater amount entanglement is, the higher quantum computation speed is, and vice versa. Furthermore, the correlations between entanglement and energy are discussed. It is shown that the entanglement degree becomes larger when input of energy into a quantum system increases, and thus the computational time is reduced accordingly. In addition, the effect of the initial states of the system on entanglement is discussed. It is concluded that entanglement behave differently with respect to one initial state from another. In particular, when algorithms are equally weighted superposition initial states, their entanglement degree becomes larger than those with non-equally weighted superposition.
出处 《计算机研究与发展》 EI CSCD 北大核心 2008年第z1期81-86,共6页 Journal of Computer Research and Development
基金 国家自然科学基金项目(60473120) 广东省自然科学基金项目(06023190)
关键词 GROVER算法 量子纠缠 绝热量子计算 绝热量子搜索算法 von Neumann熵 Grover's algorithm quantum entanglement adiabatic quantum computation adiabatic quantum search algorithm von Neumann entropy
  • 相关文献

参考文献24

  • 1[1]M A Nielsen,I L Chuang.Quantum Computation and Quantum Information.Cambridge:Cambridge University Press,2000
  • 2[2]L K Grover.A fast quantum mechanical algorithm for database search.In:Proc of the 28th Annual Symp on the Theory of Computing (STOC96).Philadelphia,Pennsylvania,United States,1996
  • 3[3]E Farhi,J Goldstone,S Gutmann,et al.Quantum computation by adiabatic evolution.http://cn.arxiv.org/pdf/quant-ph/0001106,2000-01-08/2007-03-25
  • 4[4]E Farhi,J Goldstone,S Gutmann,et al.A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem.Science,2001,292:472-476
  • 5[5]J Roland,N J Cerf.Quantum search by local adiabatic evolution.Physics Review A65,042308,2002
  • 6[6]S Das,R Kobes,G Kunstatter.Energy and efficiency of adiabatic quantum search algorithms.Journal Physics A:Mathematical and General,2003,36:2839-2845
  • 7[7]D Ahrensmeier,S Das,R Kobes,et al.Rapid data search using adiabatic quantum computation.http://cn.arxiv.org/pdf/quant-ph/0208107,2002-08-15/2007-03-25
  • 8[8]M Andrecut,M K Ali.Unstructured adiabatic quantum search.International Journal of Theoretical Physics,2004,43(4):925-931
  • 9[9]A Ekert,R Josza.Quantum algorithms:Entanglement enhanced information processing.http://cn.arxiv.org/pdf/quant-ph/9803072,1998
  • 10钱辰.量子纠缠和量子计算[J].计算机科学,2006,33(12):230-234. 被引量:8

二级参考文献38

  • 1郭光灿.量子信息引论.量子力学新进展(第一辑)[M].北京:北京大学出版社,2000.249-285.
  • 2张永德.量子测量和量子计算简述.量子力学新进展(第一辑)[M].北京:北京大学出版社,2000.286-342.
  • 3Long G L,J Phys A Math Gen,2001年,34卷,861页
  • 4Li X Q,Phys Rev.A,2001年,63卷,1期,012302页
  • 5Kim J,Phys Rev.A,2000年,61卷,3期,032312页
  • 6Leung D W,Phys Rev.A,2000年,61卷,4期,042310页
  • 7Long G L,Phys Rev.A,2000年,61卷,4期,042305页
  • 8Zhang C W,Phys Rev.A,2000年,61卷,6期,062310页
  • 9郭光灿,量子力学新进展.1,2000年,249页
  • 10张永德,量子力学新进展.1,2000年,286页

共引文献50

同被引文献14

  • 1Kirpatrick S, Gelatt C D, Vecchi M P. Optimization bysimulated Annealing [ J ]. Science, 1983,220 ( 4598 ):671-680.
  • 2Kadowaki T,Hidetoshi N. Quantum annealing in the trans-verse ising model [ J] . Physics Review E,1998,58 (5):5355-5364.
  • 3Lee Y, Berne B J. Global optimization: Quantum thermalannealing with path integral Monte Carlo [ J]. Journal ofPhysical Chemistry A,2000,104( 1) :86-95.
  • 4Stella L,Santoro G E,Tosatti E. Optimization by quantumannealing:Lessons from simple cases [ J]. Physics ReviewB,2005,72(1) :14303-14317.
  • 5Stella L, Santoro G E, Tosatti E. Monte Carlo studies ofquantum and classical annealing on a double-well [ J ].Physics Review B,2006,73( 14) : 144302-144316.
  • 6Stella L,Santoro G E. Quantum annealing of an ising spin-glass by Green's function Monte Carlo [ J]. Physics Re-view E,2007,75(3) :36703-036710.
  • 7Stella L. Studies of classical and quantum annealing [EB/OL] . [ 2015-04-09 ] . http://www. sissa. it/cm/thesis/2005/stella. pdf.
  • 8Masayuki 0, Hidetoshi N. Quantum annealing: An intro-duction and new developments [ J ] Journal of Computa-tional & Theoretical Nanoscience,2011,8(6) :963-971.
  • 9陈宏,袁宏宽.量子力学[M].北京:科学出版社,2014:27-51.
  • 10Giuseppe S,Roman M, Erio T, et al. Theory of quantumannealing of an ising spin glass [ J]. Science,2002,295(5564) :2427-2430.

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部