Swift chiral quantum walks
arXiv:2207.05168 · doi:10.1016/j.laa.2023.05.007
Abstract
A continuous-time quantum walk (CTQW) is sedentary if the return probability in the starting vertex is close to one at all times. Recent results imply that, when starting from a maximal degree vertex, the CTQW dynamics generated by the Laplacian and adjacency matrices are typically sedentary. In this paper, we show that the addition of appropriate complex phases to the edges of the graph, defining a chiral CTQW, can cure sedentarity and lead to swift chiral quantum walks of the adjacency type, which bring the returning probability to zero in the shortest time possible. We also provide a no-go theorem for swift chiral CTQWs of the Laplacian type. Our results provide one of the first, general characterization of tasks that can and cannot be achieved with chiral CTQWs.
arXiv comment20 pages, 2 figures
References in corpus (23)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Perfect state transfer in quantum spin networks
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Quantum speed limits: from Heisenberg's uncertainty principle to optimal quantum control
- An example of the difference between quantum and classical random walks
- Quantum limits to dynamical evolution
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Survival Probabilities in Coherent Exciton Transfer with Trapping
- 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
- Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
- Laplacian versus Adjacency Matrix in Quantum Walk Search
- Transport properties of continuous-time quantum walks on Sierpinski fractals
- Coherent dynamics on hierarchical systems
- Generalized quantum-classical correspondence for random walks on graphs
- Continuous-Time Quantum Walks and Trapping
- Quantum-classical distance as a tool to design optimal chiral quantum walk
- Transport efficiency of continuous-time quantum walks on graphs
- Probing the sign of on-site Hubbard interaction by two-particle quantum walks
- Topological classification of time-asymmetry in unitary quantum processes
Cited by in corpus (6)
- Complex Quantum Networks: a Topical Review
- Quantum routing of information using chiral quantum walks
- Sedentariness in quantum walks
- Multiparameter estimation of continuous-time Quantum Walk Hamiltonians through Machine Learning
- Enhanced quantum transport in chiral quantum walks
- Disorder-free localisation in continuous-time quantum walks : Role of symmetries