Generalization of grover’s algorithm to multiobject search in quantum computing, PART II: General unitary transformations Chapter uri icon

abstract

  • © 2002 by Chapman & Hall/CRC. There are major advantages in a newer version of Grover’s 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.

author list (cited authors)

  • Chen, G., & Sun, S.

Book Title

  • Mathematics of Quantum Computation

publication date

  • January 2002