Talk:Grover's algorithm/Archive 1
Appearance
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