The Generalized Quantum Database Search Algorithm

Abstract

In this paper, we analyze and enhance previously achieved results related to the generalized Grover search algorithm in terms of arbitrary initial pure state, arbitrary unitary transformation, arbitrary phase rotations, and arbitrary number of marked items. This allows us to construct an unsorted database search algorithm which can be included inside a quantum computing system. Because of its constructive nature this algorithm is capable of handling any kind of amplitude distribution at its input, provides absolute success in case of measurement and allows its output to be connected to another algorithm.