Finding more than one path through a simple maze with a quantum walk
Quantum Physics
2021-02-24 v1
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.
Keywords
Cite
@article{arxiv.2007.07340,
title = {Finding more than one path through a simple maze with a quantum walk},
author = {Mark Hillery},
journal= {arXiv preprint arXiv:2007.07340},
year = {2021}
}