JPL Technical Report Server

Nested Quantum Search and NP-Complete Problem

Show simple item record Williams, C. en_US Cerf, N. J. en_US Grover, L. K. en_US 2004-09-25 2004-09-25 1998-09-26 en_US
dc.identifier.citation MTG: The British Computer Society and the Espirit Programme of the European Commission en_US
dc.identifier.citation Helsinki, Finland en_US
dc.identifier.clearanceno 98-1306 en_US
dc.description.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). en_US
dc.format.extent 1443604 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.subject.other NP-complete problems quantum search algorithm tree search nesting en_US
dc.title Nested Quantum Search and NP-Complete Problem en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record



My Account