NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
Nested Quantum Search and NP-Complete ProblemA quantum algorithm is known that solves an unstructured search problem in a number of iterations of order square-root of d, where d is the dimension of the search space, whereas any classical algorithm scales as O(d).
Document ID
20060034775
Acquisition Source
Jet Propulsion Laboratory
Document Type
Conference Paper
External Source(s)
Authors
Williams, C.
Cerf, N. J.
Grover, L. K.
Date Acquired
August 23, 2013
Publication Date
September 26, 1998
Distribution Limits
Public
Copyright
Other
Keywords
NP-complete problems quantum search algorithm tree search nesting

Available Downloads

There are no available downloads for this record.
No Preview Available