Finding paths with quantum walks

Quantum walks, which are quantum versions of random walks, have proven useful in the development of quantum algorithms. They have been used to study searches on different graphs. In most cases, the object of the search is a distinguished vertex. However, a quantum walk can find more general objects with a quantum speedup, e.g. extra edges or subgraphs that break the symmetry of the overall graph. They can also find a path from one marked vertex to another, and an example of that will be presented.