Lively quantum walks on cycles

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.

13 pages

References in corpus (2)

• Mimicking the probability distribution of a two-dimensional Grover walk with a single-qubit coin
• Generalized open quantum walks on Apollonian networks

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