Lively quantum walks on cycles
arXiv:1512.02802 · doi:10.1088/1751-8113/49/37/375302
Abstract
We introduce a family of quantum walks on cycles parametrized by their liveliness, defined by the ability to execute a long-range move. We investigate the behaviour of the probability distribution and time-averaged probability distribution. We show that the liveliness parameter, controlling the magnitude of the additional long-range move, has a direct impact on the periodicity of the limiting distribution. We also show that the introduced model provides a method for network exploration which is robust against trapping.
arXiv comment13 pages
References in corpus (8)
- Quantum walks: a comprehensive review
- Path Selection for Quantum Repeater Networks
- Mimicking the probability distribution of a two-dimensional Grover walk with a single-qubit coin
- Quantum walks on cycles
- Finding structural anomalies in graphs by means of quantum walks
- Cooperative quantum Parrondo's games
- Generalized open quantum walks on Apollonian networks
- Quantum walks with memory on cycles
Cited by in corpus (5)
- Generalized exceptional quantum walk search
- Upperbounds on the probability of finding marked connected components using quantum walks
- Bandit Algorithm Driven by a Classical Random Walk and a Quantum Walk
- The role of quantum correlations in Cop and Robber game
- Limit properties of global interaction stochastic quantum walks on directed graphs