Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
arXiv:1610.03633 · doi:10.1007/s11128-017-1516-z
Abstract
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 with both the sender and the receiver vertex in the same part of the graph is considered. We show that in this case the dynamics of the quantum walk is independent of the size of the second part and reduces to the one for the star graph where perfect state transfer is achieved. Second, we consider the situation where the sender and the receiver vertex are in the opposite parts of the graph. In such a case the state transfer with unit fidelity is achieved only when the parts have the same size.
References in corpus (23)
- Universal computation by quantum walk
- Spatial search by quantum walk
- Connecting the discrete and continuous-time quantum walks
- Spatial search by quantum walk is optimal for almost all graphs
- Spatial search and the Dirac equation
- Optimized quantum random-walk search algorithms
- Coherent exciton transport in dendrimers and continuous-time quantum walks
- Quantum transport on small-world networks: A continuous-time quantum walk approach
- 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
- The Staggered Quantum Walk Model
- Quantum searches on highly symmetric graphs
- Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
- Staggered Quantum Walks on Graphs
- Modifying quantum walks: A scattering theory approach
- Qubit state transfer via discrete-time quantum walks
- One-Dimensional Coinless Quantum Walks
- Search on a Hypercubic Lattice through a Quantum Random Walk: II. d=2
- Quantum Search on the Spatial Grid
- Moments of Coinless Quantum Walks on Lattices
- Unveiling and exemplifying the unitary equivalence of discrete time quantum walk models
Cited by in corpus (16)
- Finding paths in tree graphs with a quantum walk
- Finding paths with quantum walks or quantum walking through a maze
- Quantum walk based state transfer algorithms on the complete M-partite graph
- Quantum state transfer on the complete bipartite graph
- Quantum walk state transfer on a hypercube
- Scattering Quantum Random Walks on Square Grids and Randomly Generated Mazes
- Non-markovianity and bound states in quantum walks with a phase impurity
- Quantum walk-based protocol for secure communication between any two directly connected nodes on a network
- Non-Markovianity in Discrete-Time Open Quantum Random Walk on Arbitrary Graphs
- Periodicity and perfect state transfer of Grover walks on quadratic unitary Cayley graphs
- Search and state transfer between hubs by quantum walks
- State transfer in Grover walks on unitary and quadratic unitary Cayley graphs over finite commutative rings
- Perfect edge state transfer on cubelike graphs
- Uniform mixing on integral abelian Cayley graph
- Generalized quantum teleportation of shared quantum secret with quantum walks
- Quantum state transfer and periodicity in discrete-time quantum walks under non--Markovian dephasing noise