期刊文献+

多模式部分量子搜索算法 被引量:4

Multi-pattern Partial Quantum Search Algorithm
下载PDF
导出
摘要 为了提高数据库的搜索速度,提出了多模式部分量子搜索算法。该算法把数据库的搜索项分成若干等份,通过舍弃不重要信息,再用多模式量子搜索算法,加快搜索速度,并可在数据库中同时搜索到多个模式.实例表明,当数据库有7.206×1016个搜索项时,采用部分搜索算法比全局搜索算法可以减少1.325×106次搜索迭代. A multi-pattern partial quantum search algorithm was proposed to increase database searching speed. The algorithm groups the items of a database into equal blocks, neglects some unimportant information, and uses the multi-pattern quantum search algorithm to increase searching speed and concurrently search multi-patterns in the database. An example indicates that the proposed partial algorithm saves 1. 325 ×10^6 iterations against the global search algorithm in a database with 7. 206×10^16 items.
作者 周日贵
出处 《西南交通大学学报》 EI CSCD 北大核心 2008年第4期494-497,共4页 Journal of Southwest Jiaotong University
基金 国防重大基础预研项目(S0500A001) 南京航空航天大学2006年度博士学位论文创新与创优基金(BCXJ06-10)
关键词 部分搜索 量子算法 数据库 partial search quantum algorithm data base
  • 相关文献

参考文献10

  • 1FEYNMAN R P. Simulating physics with computers[J]. Int J Theor Phys,1982, 21 (6&7) : 467-488.
  • 2DEUTSCH D. Quantum theory, the Church-Turing principle and the universal quantum computer[ C ] //Proceedings of the Royal Society of London (Series A). London: Oxford University Press,1985, 400: 97-117.
  • 3SHOR P W. Algorithms for quantum computation: discrete logarithms and factoring [ C ] ,//Proceedings of the 35th Annual Symposium on Foundations of Computer Science. Los Alamitos : IEEE, 1994 : 124-134.
  • 4SHOR P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[ J ]. SIAM Journal on Computing,1997, 26 (5) : 1 484-1 509.
  • 5GROVER L k. A fast quantum mechanical algorithm for database search [ C ]//Proceedings of 28th Annual ACM Symposium on the Theory of Computing (STOC). Philadelphia: ACM Press, 1996: 212-219.
  • 6LONG G L. Grover Algorithm with zero theoretical failure rate [ J]. Physical Review A,2001,64 (2) : 022307-1-1022307-4.
  • 7GROVER L K, RADHAKRISHNAN J. Is partial quantum search of a database any easier? [ DB/OL]. 2004.07, http: // arXiv: quant-ph/0407122 v 4 7 Feb 2005.
  • 8KOREPIN V E, GROVER L K Simple algorithm for partial quantum search [ J ]. Quantum Information Processing, 2006, 5(1) : 5-10.
  • 9周日贵,谢强,姜楠,丁秋林.多模式高概率量子搜索算法[J].南京航空航天大学学报,2007,39(2):227-230. 被引量:6
  • 10ZALKA C. Grover's quantum searching algorithm is optimal[J]. Physical Review A,1999, 60(4) : 2 746-2 751.

二级参考文献15

  • 1LIFei ZHAOShengmei ZHENGBaoyu.Performance of a Single Quantum Neuron[J].Chinese Journal of Electronics,2005,14(1):111-114. 被引量:2
  • 2Ambainis A.Quantum lower bounds by quantum arguments[J].Journal of Computer and System Sciences,2002,64:750-767.
  • 3Scarani V.Quantum computing[J].American Journal of Physics,1998,66 (11):956-960.
  • 4Deutsch 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.
  • 5Deutsch D.Quantum computational networks[J].Mathematical and Physical Sciences,1989,425(1868):73-90.
  • 6Shor 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.
  • 7Shor P W.Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J].SIAM J Comp,1997(26):1484-1510.
  • 8Ricks 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.
  • 9Grover 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.
  • 10Boyer M,Brassard G,Hoyer P,et al.Tight bounds on quantum searching[J].Fortsch Phys,1998(46):493-506.

共引文献5

同被引文献60

引证文献4

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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