Grover Algorithm with zero theoretical failure rate

Abstract

In standard Grover's algorithm for quantum searching, the probability of finding the marked item is not exactly 1. In this Letter we present a modified version of Grover's algorithm that searches a marked state with full successful rate. The modification is done by replacing the phase inversion by two phase rotation through angle $ϕ$. The rotation angle is given analytically to be $ϕ=2 \arcsin(\sin{π\over (4J+6)}\over \sinβ)$, where $\sinβ={1\over \sqrt{N}}$, $N$ the number of items in the database, and $J$ an integer equal to or greater than the integer part of $({π\over 2}-β)/(2β)$. Upon measurement at $(J+1)$-th iteration, the marked state is obtained with certainty.