期刊
PHYSICAL REVIEW A
卷 94, 期 2, 页码 -出版社
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.94.022301
关键词
-
资金
- Czech Technical University in Prague [SGS16/241/OHK4/3T/14]
- GACR [14-02901P]
- [RVO 68407700]
Perfect state transfer between two marked vertices of a graph by means of a discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vertices, sender and receiver. It is shown by explicit calculation that, for the coined quantum walks on a star graph and a complete graph with self-loops, perfect state transfer between the sender and receiver vertex is achieved for an arbitrary number of vertices N in O(root N) steps of the walk. Finally, we show that Szegedy's walk with queries on a complete graph allows for state transfer with unit fidelity in the limit of large N.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据