On a family of quantum search algorithms robust against phase imperfections

Abstract

A family of algorithms has been recently considered for sure-success quantum search problems. When the phase inversion operations of these algorithms are identical to those of the standard Grover algorithm, it is found that this family of algorithms is robust against the inevitable phase imperfections.