Quantum walks with infinite hitting times

Abstract

Hitting times are the average time it takes a walk to reach a given final vertex from a given starting vertex. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks can have infinite hitting times for some initial states. We seek criteria to determine if a given walk on a graph will have infinite hitting times, and find a sufficient condition, which for discrete time quantum walks is that the degeneracy of the evolution operator be greater than the degree of the graph. The set of initial states which give an infinite hitting time form a subspace. The phenomenon of infinite hitting times is in general a consequence of the symmetry of the graph and its automorphism group. Using the irreducible representations of the automorphism group, we derive conditions such that quantum walks defined on this graph must have infinite hitting times for some initial states. In the case of the discrete walk, if this condition is satisfied the walk will have infinite hitting times for any choice of a coin operator, and we give a class of graphs with infinite hitting times for any choice of coin. Hitting times are not very well-defined for continuous time quantum walks, but we show that the idea of infinite hitting-time walks naturally extends to the continuous time case as well.

28 pages, 3 figures in EPS format

References in corpus (1)

• Connecting the discrete and continuous-time quantum walks

Cited by in corpus (8)

• Decoherence in quantum walks - a review
• A random walk approach to quantum algorithms
• Quantum walks on quotient graphs
• Recurrence properties of unbiased coined quantum walks on infinite $d$-dimensional lattices
• Decoherence vs entanglement in coined quantum walks
• Recurrence of biased quantum walks on a line
• Optimal computation with non-unitary quantum walks
• Where to quantum walk