Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

a quantum computer could do it in O(n^.5) with grover's algorithm


How would it beat O(1)? Even a quantum computer can't read in the wordlist without looking at every word.


Quantum computers can see information about more than one word with just a single “look.”

You’re right to think this is impossible though. Grover’s algorithm was one of the first examples of something that clearly could not ever exist classically.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: