Jump to content

Talk:Grover's algorithm/Archive 1

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
< Talk:Grover's algorithm
This is an old revision of this page, as edited by 203.37.81.xxx (talk) at 10:24, 27 December 2001 (Still exponential for NP-complete problems?). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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?


Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Grover%27s_algorithm/Archive_1&oldid=255757"