# Finding paths with quantum walks or quantum walking through a maze

Author(s): Daniel Reitzner, Mark Hillery, and Daniel Koch
We show that it is possible to use a quantum walk to find a path from one marked vertex to another. In the specific case of $M$ stars connected in a chain, one can find the path from the first star to the last one in $O(M\sqrt{N})$ steps, where $N$ is the number of spokes of each star. First we prov...
[Phys. Rev. A 96, 032323] Published Wed Sep 13, 2017

Article web page: