Viewing a single comment thread. View all comments

Cryptizard t1_j2hzmlw wrote

That’s not really how Grover’s algorithm works. It can find the correct preimage of a function with only O(sqrt(N)) calls to the function. It can’t find things in a list in less than O(N) time because it would take that long just to read the list elements into registers.

3