期刊
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL
卷 48, 期 3, 页码 -出版社
IOP PUBLISHING LTD
DOI: 10.1088/1751-8113/48/3/035304
关键词
quantum information; quantum walk; quantum search; graph theory
In previous papers about searches on star graphs several patterns have been made apparent; the speed up only occurs when graphs are 'tuned' so that their time step operators have degenerate eigenvalues, and only certain initial states are effective. More than that, the searches are never faster than O(root N) time. In this paper the problem is defined rigorously, the causes for all of these patterns are identified, sufficient and necessary conditions for quadratic-speed searches for any connected subgraph are demonstrated, the tolerance of these conditions is investigated, and it is shown that ( unfortunately) we can do no better than O(root N) time. Along the way, a useful formalism is established that may be useful in future work involving highly symmetric graphs.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据