可变旋转轴的Grover改进算法  

An Improved Grover Algorithm of Variable Rotation Axis

作　　者：叶庆波[1] 李飞[2] 

机构地区：[1]南京邮电大学通信与信息工程学院,江苏南京210003 [2]南京邮电大学信号处理与传输研究院,江苏南京210003

出　　处：《南京邮电大学学报（自然科学版）》2013年第4期50-54,共5页Journal of Nanjing University of Posts and Telecommunications：Natural Science Edition

摘　　要：为提高Grover算法的搜索效率,基于量子并行计算原理,提出了一种改进型的量子搜索算法。该算法在保证搜索成功概率的前提下,能将计算的迭代次数降低到Grover算法的1/3。理论推导和模拟仿真结果表明,该算法能明显降低计算量。In order to improve the searching efficiency of the Grover algorithm, an improved quantum search algorithm is proposed based on quantum parallel computation. The improved algorithm can de- crease the number of iterations to of the Grover algorithm while guaranteeing the probability of success. By Theoretical derivation and simulation results show that the improved algorithm can significantly reduce the amount of computation.

关 键 词：Grover搜索算法 相位旋转 可变旋转轴 量子并行计算 

分 类 号：TN911[电子电信—通信与信息系统]