Quantum state transfer on the complete bipartite graph
arXiv:2111.13197 · doi:10.1088/1751-8121/ac5217
Abstract
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the sender and receiver vertices are in the same partition of the graph and when the sender and receiver are in opposite partitions of the same size. By changing the coin operator, we analyze the state transfer problem and we show that it is still possible to achieve state transfer with high fidelity even when the sender and receiver are in different partitions with different sizes. Moreover, it is also possible to use an active switch approach using lackadaisical quantum walks where the marked vertex is switched between the sender and receiver during the algorithm.
arXiv comment17 pages, 10 figures
References in corpus (10)
- Quantum Communication Through an Unmodulated Spin Chain
- Spatial search by quantum walk is optimal for almost all graphs
- Perfect state transfer and efficient quantum routing: a discrete-time quantum walk approach
- Discrete Time Quantum Walk Approach to State Transfer
- Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- Coined Quantum Walks on Weighted Graphs
- Qubit state transfer via discrete-time quantum walks
- Search by Lackadaisical Quantum Walk with Nonhomogeneous Weights
- Quantum walk based state transfer algorithms on the complete M-partite graph