Jump to content

Talk:Grover's algorithm/Archive 1

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by CYD (talk | contribs) at 15:42, 27 December 2001. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

My understanding is that Grover's algorithm still takes exponential time to solve NP-complete problems. The solution will be much faster than a naive brute force solution on a conventional computer, but not necessarily faster than a smart algorithm on a conventional computer. Is this correct?


Yes, AFAIK -- CYD