Sojourn Times for the One Dimensional Grover Walk

Abstract

Using the technique of path counting we show non-existence of sojourn times in the Grover walk which is related to the Grover's algorithm in computer science.

Conjectural Article. Contains an open problem, classifying all matrices up to general dimensionality with the property "non-existence of sojourn times implies localization"

References in corpus (3)

• Ergodic transitions in continuous-time random walks
• Sojourn Times and the Fragility Index
• Sojourn times of the Hadamard walk in one dimension

Cited by in corpus (1)

• Spectral analysis of discrete-time quantum walks in the quarter plane