Author(s)

Xin Li, Panchi Li

School of Computer & Information Technology, Northeast Petroleum University, Daqing, China.

When the Grover’s algorithm is applied to search an unordered database, the probability of success usually decreases with the increase of marked items. To address this phenomenon, a fixed-phase quantum search algorithm with more flexible behavior is proposed. In proposed algorithm, the phase shifts can be fixed at the different values to meet the needs of different practical problems. If research requires a relatively rapid speed, the value of the phase shifts should be appropriately increased, if search requires a higher success probability, the value of the phase shifts should be appropriately decreased. When the phase shifts are fixed at , the success probability of at least 99.38% can be obtained in iterations.

Quantum Computing; Quantum Searching; Grover Algorithm; Fixed Phase Shifting

X. Li and P. Li, "A Fixed-Phase Quantum Search Algorithm with More Flexible Behavior," Journal of Quantum Information Science, Vol. 2 No. 2, 2012, pp. 28-34. doi: 10.4236/jqis.2012.22006.