Sojourn Times for the One Dimensional Grover Walk
arXiv:1109.2259
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.
arXiv commentConjectural 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 (7)
- Ergodic transitions in continuous-time random walks
- On Sojourn Times in the -PS Model, Conditioned on the Number of Other Users
- Sojourn Times and the Fragility Index
- Sojourn times of the Hadamard walk in one dimension
- Explicit formulas for the moments of the sojourn time in the M/G/1 processor sharing queue with permanent jobs
- Joint distribution of the process and its sojourn time for pseudo-processes governed by high-order heat equation
- On the exact asymptotics for the stationary sojourn time distribution in a tandem of queues with light-tailed service times