Grover’s Algorithm
Grover’s Algorithm, developed in 1996, is a quantum algorithm that searches through unsorted databases with N entries in O(N1/2) time and using O(logN) storage space. It is asymptotically optimal and outperforms classical hit-and-trial methods that take at least O(N) steps in the worst case scenario. However, it was later proven that no quantum solution to this problem can evaluate the function fewer than O(N1/2) times. Python code also available.