Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21340%2F16%3A00302319" target="_blank" >RIV/68407700:21340/16:00302319 - isvavai.cz</a>
Result on the web
<a href="http://journals.aps.org/pra/abstract/10.1103/PhysRevA.94.022301" target="_blank" >http://journals.aps.org/pra/abstract/10.1103/PhysRevA.94.022301</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1103/PhysRevA.94.022301" target="_blank" >10.1103/PhysRevA.94.022301</a>

Result language
angličtina
Original language name
Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BE - Theoretical physics
OECD FORD branch
—

Project
<a href="/en/project/GP14-02901P" target="_blank" >GP14-02901P: Solvable models of quantum walks and their applications</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)