4 ms·

Grover's algorithm allows you to search over an unordered data set of size n in O(n^(1/2)) time and O(log(n)) space.