Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (24): 146-147.DOI: 10.3778/j.issn.1002-8331.2008.24.043
• 数据库、信号与信息处理 • Previous Articles Next Articles
ZHONG Pu-cha,BAO Wan-su
Received:
Revised:
Online:
Published:
Contact:
钟普查,鲍皖苏
通讯作者:
Abstract: Grover’s quantum search algorithm solves the unsorted database search problem in O(√2n/M) with quadratic speed-up over classical algorithms.But Grover’s algorithm will be inefficient when the number of matching is close to 2n/2.This paper presents an quantum multi-object search algorithm,which can find the object with the probability of success at least 97.36% when the number of objects is more than 2n/3.
Key words: quantum computing, quantum algorithm, Grover’algorithm, phase shifts
摘要: Grover量子搜索算法解决了未加整理的数据库搜索问题,在2n个元素中搜索M个目标元素时,计算复杂度为O(√2n/M),相对于经典算法实现了二次加速,但Grover算法在目标元素个数接近2n/2时成功率较低。提出了一种针对多目标元素的量子搜索算法,当目标元素个数大于2n/3时,能以不低于97.36%的概率找到目标元素。
关键词: 量子计算, 量子算法, Grover算法, 相位变换
ZHONG Pu-cha,BAO Wan-su. Quantum multi-object search algorithm[J]. Computer Engineering and Applications, 2008, 44(24): 146-147.
钟普查,鲍皖苏. 多目标元素的量子搜索算法[J]. 计算机工程与应用, 2008, 44(24): 146-147.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2008.24.043
http://cea.ceaj.org/EN/Y2008/V44/I24/146
Quantum immune optimization algorithm based on cloud model