Grover 1996 (Proc. STOC 212) gave a quantum algorithm for unstructured search with quadratic speedup: given an oracle U_f marking M out of N items, find any marked item in O(√(N/M)) queries vs classical O(N/M). Algorithm: initialise…
Grover 1996 (Proc. STOC 212) gave a quantum algorithm for unstructured search with quadratic speedup: given an oracle U_f marking M out of N items, find any marked item in O(√(N/M)) queries vs classical O(N/M). Algorithm: initialise…