How would it beat O(1)? Even a quantum computer can't read in the wordlist without looking at every word.
You’re right to think this is impossible though. Grover’s algorithm was one of the first examples of something that clearly could not ever exist classically.