期刊文献+

多模式高概率量子搜索算法 被引量:6

Multi-Pattern High Probable Quantum Search Algorithm
在线阅读 下载PDF
导出
摘要 量子搜索问题是发展量子神经网络必须要解决的问题之一。本文在分析了G rover量子算法基础上,针对量子神经网络要处理多模式问题提出了一个多模式高概率量子搜索算法,它通过一系列的么正操作能在模式集中以较高的概率搜索目标,并且该算法在搜索目标模式时能在一次算法的执行中就找到目标,所以它远比经典的搜索方法要快,而且随着模式集和目标数的增多,它运行效果越好,最后验证了算法的可行性和有效性。 In the field of quantum neural network, there are many problems to be settled ,for example, quantum search problem must be solved for developing QNN. Based on Grover quantum algorithm,this paper presents a multi-pattern high probable quantum search algorithm, which can search targets high probably in the pattern sets through a series of unitary transformation. The algorithm can find goals by only one searching of the pattern,so its speed is much faster than the classicial counterpart. Moreover, the more the numbers of pattern sets and targets, the better it works. Finally, the feasibility and the validity of the algorithm are verified.
出处 《南京航空航天大学学报》 EI CAS CSCD 北大核心 2007年第2期227-230,共4页 Journal of Nanjing University of Aeronautics & Astronautics
基金 江西省2004年教育科学"十五"规划课题(04YB145)资助项目 2005年度省教育厅科技计划(DB20050816)资助项目 南京航空航天大学2006年度博士学位论文创新与创优基金(BCXJ06-10)资助项目
关键词 量子搜索算法 多模式 高概率 GROVER算法 quantum search algorithm multi-pattern high probable Grover algorithm
  • 相关文献

参考文献15

  • 1Ambainis A.Quantum lower bounds by quantum arguments[J].Journal of Computer and System Sciences,2002,64:750-767.
  • 2Scarani V.Quantum computing[J].American Journal of Physics,1998,66 (11):956-960.
  • 3Deutsch D.Quantum theory,the church-turing principle and the universal quantum computer[C]// Proceedings of the Royal Society of London (series A).London,UK:Oxford University Press,1985,400:97-117.
  • 4Deutsch D.Quantum computational networks[J].Mathematical and Physical Sciences,1989,425(1868):73-90.
  • 5Shor P W.Algorithms for quantum omputation discrete logarithms and factoring[C]//Proceedings of the 35th Annual Symposium on Foundations of Computer Science.Santa Fe,USA:IEEE Computer Society Press,1994:124-134.
  • 6Shor P W.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J].SIAM J Comp,1997(26):1484-1510.
  • 7Ricks B,Ventura D.Training a quantum neural network[EB/OL].(2002-10)[2003-03].http://books.nips.cc/papers/files/nips16/NIPS 2003_ET05.pdf.
  • 8Grover L K.A fast quantum mechanical algorithm for database search[C] // Proceedings 28th Annual ACM Symposium on the Theory of Computing (STOC).Philadelphia PA,USA:ACM Press,1996:212-219.
  • 9Boyer M,Brassard G,Hoyer P,et al.Tight bounds on quantum searching[J].Fortsch Phys,1998(46):493-506.
  • 10Zalka C.Grover's quantum searching algorithm is optimal[J].Physical Review A,1999,60:2746-2751.

二级参考文献10

  • 1Peter W Shor. Algorithm for Quantum Computation:Discrete Logarithms and Factoring[A]. Proc of the 35th Annual IEEE Symp on Foundations of Computer Science[C]. 1994.
  • 2Lov K Grover. A Fast Quantum Mechanical Algorithm for Database Search[A]. Proc of the 28th Annual ACM Symp on Theory of Computing[C]. 1996.
  • 3Michel Boyer, Gilles Brassard,Peter Hoyer,et al. Tight Bounds on Quantum Searching[A]. Proc of the Workshop on Physics and Computation(PhysComp96)[C]. 1996.36-43.
  • 4A Elitzur, L Vaidman. Quantum Mechanical Intercation Free Measurements[J]. Foundations of Physics 23,1993.
  • 5Lov K Grover. Quantum Search on Structured Problems[J]. Chaos, Solitons,and Fractaks,1999,10:1695-1705.
  • 6David P DiVincenzo. Quantum Computation[J]. Science, 1995,270:255-261.
  • 7Vladimir Cenry. Quantum Computers and Intractable (NP-Complete) Computing Problems[J]. Physical Review A, 1993,48:116-119.
  • 8D Deutsch. Quantum Theory, the Church-Turing Princple and the Universal Quantum Computer[J]. Pro R Soc London A,1985, 400:97-117.
  • 9Tad Hogg. Quantum Search Heuristics[J]. Physics Review A,2000,61:052311.
  • 10张镇九,张昭理.量子信息讲座续讲 第一讲 量子计算中的因子分解[J].物理,2000,29(9):560-564. 被引量:10

共引文献16

同被引文献60

引证文献6

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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