Quantum walk based state transfer algorithms on the complete M-partite graph
arXiv:2212.00546 · doi:10.1103/PhysRevA.103.042222
Abstract
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 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 (36)
- Statistical mechanics of complex networks
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum Amplitude Amplification and Estimation
- Quantum Communication Through an Unmodulated Spin Chain
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- Spatial search by quantum walk
- From quantum cellular automata to quantum lattice gases
- Spatial search by quantum walk is optimal for almost all graphs
- Optimized quantum random-walk search algorithms
- Quantum walks based on an interferometric analogy
- Grover Search with Lackadaisical Quantum Walks
- Global Symmetry is Unnecessary for Fast Quantum Search
- Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
- 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
- Discrete Time Quantum Walk Approach to State Transfer
- Quantum searches on highly symmetric graphs
- Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
- Scattering theory and discrete-time quantum walks
- Modifying quantum walks: A scattering theory approach
- Faster Search by Lackadaisical Quantum Walk
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- On the optimality of spatial search by continuous-time quantum walk
- Finding structural anomalies in graphs by means of quantum walks
- Qubit state transfer via discrete-time quantum walks
- Quantum search algorithms on the hypercube
- Equivalence between discrete quantum walk models in arbitrary topologies
- Quantum walks as a probe of structural anomalies in graphs
- Finding paths in tree graphs with a quantum walk
- Search by Lackadaisical Quantum Walk with Nonhomogeneous Weights
- Continuous-time quantum walk spatial search on the Bollobás scale-free network
- Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk
- Finding paths with quantum walks or quantum walking through a maze
- Unveiling and exemplifying the unitary equivalence of discrete time quantum walk models