期刊
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL
卷 54, 期 9, 页码 -出版社
IOP Publishing Ltd
DOI: 10.1088/1751-8121/abde79
关键词
quantum walk; quantum algorithm; search algorithm
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.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据