How Classical and Quantum Computers Search a Maze
A classical computer walks the maze one path at a time. A quantum computer makes the wrong paths cancel out. What Grover's algorithm actually does, and why it is quadratically, not exponentially, faster.