Generalization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time
Quantum Physics
2007-05-23 v1
Abstract
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.
Keywords
Cite
@article{arxiv.quant-ph/0007123,
title = {Generalization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time},
author = {Goong Chen and Stephen A. Fulling and Jeesen Chen},
journal= {arXiv preprint arXiv:quant-ph/0007123},
year = {2007}
}
Comments
20 pages