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

TL;DR

This paper demonstrates that quantum walks can efficiently find multiple paths in simple maze-like graphs, showcasing a quantum speedup over classical methods.

Contribution

It introduces a quantum walk approach to identify multiple paths in star graph chains, highlighting a novel application of quantum algorithms for pathfinding.

Findings

Quantum walks can find multiple paths with speedup

Quantum approach outperforms classical in maze pathfinding

Effective in simple star graph chains

Abstract

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.