Behavior of quantum search algorithm with small phase rotations  

作　　者：李欣 Cheng Chuntian Li Panchi Xu Shaohua 

机构地区：[1]School of Electronics and Information Engineering, Dalian University of Technology, Dalian 116024, P.R. China [2]Institute of Hydropower System and Hydroinformatics, I）alian University of Technology, Dalian 116024, P.R. China [3]School of Computer ＆ Information Technology, Northeast Petroleum University, Daqing 163318, P.R. China

出　　处：《High Technology Letters》2011年第1期91-96,共6页高技术通讯（英文版）

基　　金：Supported by National Natural Science Foundation of China （ No. 60773065 ）.

摘　　要：When the Grover＇ s original algorithm is applied to search an unordered database, the success probability decreases rapidly with the increase of marked items. Aiming at this problem, a general quantum search algorithm with small phase rotations is proposed. Several quantum search algorithms can be derived from this algorithm according to different phase rotations. When the size of phase rotations are fixed at 0. 01π, the success probability of at least 99. 99% can be obtained in 0（√N/M） iterations.

关 键 词：quantum computing quantum searching Grover＇ s algorithm phase matching small phase rotations 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TN946.2[自动化与计算机技术—计算机科学与技术]