Finding more than one path through a simple maze with a quantum walk

We study quantum walks through chains consisting of two and three star graphs. The first star has a distinguished vertex labelled START and the last has one labelled END. There are multiple paths between these two vertices, and the object is to find these paths. We show that a quantum walk can do this with a quantum speedup.

Automated summary

In this study, we explore quantum walks on chains composed of two and three star graphs. By examining the paths between two specified vertices in these graphs, we demonstrate that quantum walks can achieve a quantum speedup.