Abstract
Quantum search is well suited to spaces that can be described in brief encodings, such as integers or a set of algorithmic transformations in an abbreviated representation, but needs adaptation to deal efficiently with datasets. A method is presented for exploiting the global aggregation properties of a search operator so that the data space (extension) and algorithmic space can be explored in parallel rather than in succession.
© 2001 Optical Society of America
PDF ArticleMore Like This
M. Suhail Zubairy, Marlan O. Scully, and Goong Chen
PB14 International Conference on Quantum Information (QIM) 2001
Demosthenes Ellinas and Christos Konstadakis
PB12 International Conference on Quantum Information (QIM) 2001
J.-H. Chung and A.M. Weiner
CTuN7 Conference on Lasers and Electro-Optics (CLEO:S&I) 2001