Generalization of grovers algorithm to multiobject search in quantum computing, PART II: General unitary transformations
Chapter
Overview
Identity
Additional Document Info
View All
Overview
abstract
2002 by Chapman & Hall/CRC. There are major advantages in a newer version of Grovers quantum algorithm [4] utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject search. We show the techniques to achieve the reduction of the problem to one on an invariant subspace of dimension just equal to two.