NASA NTRS · 20060034775
Nested Quantum Search and NP-Complete Problem
Abstract
A 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).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Williams, C., Cerf, N. J., Grover, L. K.. 1998-09-26. Nested Quantum Search and NP-Complete Problem. https://engineeringpapers.com/record/nasa%3A20060034775/nested-quantum-search-and-np-complete-problem
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.