57 citations · 121 across the 5 of their papers we have counts for
5 papers
Search and state transfer between hubs by quantum walks
Stanislav Skoupy, Martin Stefanak
Search and state transfer between hubs, i.e. fully connected vertices, on otherwise arbitrary connected graph is investigated. Motivated by a recent result of Razzoli et al. (J. Ph…
Quantum walk state transfer on a hypercube
Martin Stefanak, Stanislav Skoupy
We investigate state transfer on a hypercube by means of a quantum walk where the sender and the receiver vertices are marked by a weighted loops. First, we analyze search for a si…
Quantum walk based state transfer algorithms on the complete M-partite graph
Stanislav Skoupy, Martin Stefanak
We investigate coined quantum walk search and state transfer algorithms, focusing on the complete -partite graph with vertices in each partition. First, it is shown that by…
Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
Martin Stefanak, Stanislav Skoupy
We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation w…
Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
Martin Stefanak, Stanislav Skoupy
Perfect state transfer between two marked vertices of a graph by means of discrete-time quantum walk is analyzed. We consider the quantum walk search algorithm with two marked vert…