Generalization of grover’s algorithm to multiobject search in quantum computing, part I: Continuous time and discrete time Academic Article uri icon

abstract

  • © 2002 by Chapman & Hall/CRC. L. K. Grover’s 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 Grover’s 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.

author list (cited authors)

  • Chen, G., Fulling, S. A., & Chen, J.

publication date

  • January 2002