论文标题
通过量子步行找到一个以上的路径
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.
