Quantum walks (QWs) describe particles evolving coherently on a graph. The internal degree of freedom corresponds to a Hilbert space, called a coin system. We consider QWs on Cayley graphs of some group
G. In the literature, investigations concerning infinite
G have been focused on graphs corresponding to
G=Zd with a coin system of dimension 2, whereas for a one-dimensional coin (so-called scalar QWs) only the case of finite
G has been studied. Here we prove that the evolution of a scalar QW with
G infinite Abelian is trivial, providing a thorough classification of this kind of walks. Then we consider the infinite dihedral group ${D}_{\ensuremath{\infty}}$, that is, the unique non-Abelian group
G containing a subgroup $H\ensuremath{\cong}\mathbb{Z}$ with two cosets. We characterize the class of QWs on the Cayley graphs of ${D}_{\ensuremath{\infty}}$, and, via a coarse-graining technique, we show that it coincides with the class of spinorial walks on
Z which satisfies parity symmetry. This class of QWs includes the Weyl and the Dirac QWs. Remarkably, there exist also spinorial walks that are not coarse graining of a scalar QW, such as the Hadamard walk.
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.