Quantum Computing.
of an unique word over a random list of words whose number is a power of 2. A classical computer will find the word after taking a number of steps of the same order as the number of words. Grover is faster because the search ends after a number of steps that is tonly he square root of the number of