Grover's Algorithm for Multiobject Search in Quantum Computing
Quantum Physics
2007-05-23 v2
Abstract
L. K. Grover's search algorithm in quantum computing gives an optimal, square-root speedup in the search for a single object in a large unsorted database. In this paper, we expound Grover's algorithm in a Hilbert-space framework that isolates its geometrical essence, and we generalize it to the case where more than one object satisfies the search criterion.
Keywords
Cite
@article{arxiv.quant-ph/9909040,
title = {Grover's Algorithm for Multiobject Search in Quantum Computing},
author = {G. Chen and S. A. Fulling and M. O. Scully},
journal= {arXiv preprint arXiv:quant-ph/9909040},
year = {2007}
}
Comments
11 pages, LaTeX; for proceedings of Jackson Hole Quantum Optics Workshop in honor of Daniel Walls Corrections and minor revisions