Quantum walk based state transfer algorithms on the complete M-partite graph

Abstract

We investigate coined quantum walk search and state transfer algorithms, focusing on the complete $M$-partite graph with $N$ vertices in each partition. First, it is shown that by adding a loop to each vertex the search algorithm finds the marked vertex with unit probability in the limit of a large graph. Next, we employ the evolution operator of the search with two marked vertices to perform a state transfer between the sender and the receiver. We show that when the sender and the receiver are in different partitions the algorithm succeeds with fidelity approaching unity for a large graph. However, when the sender and the receiver are in the same partition the fidelity does not reach exactly one. To amend this problem we propose a state transfer algorithm with an active switch, whose fidelity can be estimated based on the single vertex search alone.

References in corpus (14)

• Spatial search by quantum walk
• Optimized quantum random-walk search algorithms
• Connectivity is a Poor Indicator of Fast Quantum Search
• Perfect state transfer and efficient quantum routing: a discrete-time quantum walk approach
• Quantum walks on quotient graphs
• Quantum searches on highly symmetric graphs
• Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
• Modifying quantum walks: A scattering theory approach
• On the optimality of spatial search by continuous-time quantum walk
• Qubit state transfer via discrete-time quantum walks
• Finding paths in tree graphs with a quantum walk
• Continuous-time quantum walk spatial search on the Bollobás scale-free network
• Finding paths with quantum walks or quantum walking through a maze
• Unveiling and exemplifying the unitary equivalence of discrete time quantum walk models