Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
  • Optical Fiber Communication Conference and International Conference on Quantum Information
  • 2001 OSA Technical Digest Series (Optica Publishing Group, 2001),
  • paper PB30

From extensional to intensional description

Not Accessible

Your library or personal account may give you access

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 Article
More Like This
Quantum Optical Implementation of Quantum Computing Algorithms

M. Suhail Zubairy, Marlan O. Scully, and Goong Chen
PB14 International Conference on Quantum Information (QIM) 2001

Noisy Grover's search algorithm

Demosthenes Ellinas and Christos Konstadakis
PB12 International Conference on Quantum Information (QIM) 2001

Ambiguity of ultrashort pulses retrieved from intensity autocorrelation and power spectrum traces

J.-H. Chung and A.M. Weiner
CTuN7 Conference on Lasers and Electro-Optics (CLEO:S&I) 2001

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved