part I: Continuous time and discrete time Generalization of grovers algorithm to multiobject search in quantum computing

2002 by Chapman & Hall/CRC. L. K. Grovers search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grovers algorithm in a Hilbert-space framework for both continuous and discrete time cases that isolates its geometrical essence to the case where more than one object satisfies the search criterion.

Generalization of grovers algorithm to multiobject search in quantum computing, part I: Continuous time and discrete time Academic Article