Recurrence properties of unbiased coined quantum walks on infinite $d$-dimensional lattices

Abstract

The Pólya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. Štefaňák, I. Jex and T. Kiss, Phys. Rev. Lett. \textbf{100}, 020501 (2008)] which is based on a specific measurement scheme. The Pólya number of a quantum walk depends in general on the choice of the coin and the initial coin state, in contrast to classical random walks where the lattice dimension uniquely determines it. We analyze several examples to depict the variety of possible recurrence properties. First, we show that for the class of quantum walks driven by independent coins for all spatial dimensions, the Pólya number is independent of the initial conditions and the actual coin operators, thus resembling the property of the classical walks. We provide an analytical estimation of the Pólya number for this class of quantum walks. Second, we examine the 2-D Grover walk, which exhibits localisation and thus is recurrent, except for a particular initial state for which the walk is transient. We generalize the Grover walk to show that one can construct in arbitrary dimensions a quantum walk which is recurrent. This is in great contrast with the classical walks which are recurrent only for the dimensions $d=1,2$. Finally, we analyze the recurrence of the 2-D Fourier walk. This quantum walk is recurrent except for a two-dimensional subspace of the initial states. We provide an analytical formula of the Pólya number in its dependence on the initial state.

References in corpus (9)

• Connecting the discrete and continuous-time quantum walks
• Optimizing the discrete time quantum walk using a SU(2) coin
• A random walk approach to quantum algorithms
• Quantum walks with infinite hitting times
• Quantum random walk of two photons in separable and entangled state
• Implementing the one-dimensional quantum (Hadamard) walk using a Bose-Einstein Condensate
• Modifying quantum walks: A scattering theory approach
• Wigner formula of rotation matrices and quantum walks
• Scattering quantum random-walk search with errors

Cited by in corpus (21)

• Mimicking the probability distribution of a two-dimensional Grover walk with a single-qubit coin
• Coined quantum walks on percolation graphs
• Recurrence of biased quantum walks on a line
• Recurrences in three-state quantum walks on a plane
• A graph with fractional revival
• Full-revivals in 2-D Quantum Walks
• Strongly trapped two-dimensional quantum walks
• Decoherence on a two-dimensional quantum walk using four- and two-state particle
• Dynamic conditioning of two particle discrete-time quantum walks
• One-dimensional quantum walks with one defect
• Limit theorems and localization of three state quantum walks on a line defined by generalized Grover coins
• Localization of discrete-time quantum walks on a half line via the CGMV method
• The spreading behavior of quantum walks induced by drifted random walks on some magnifier graph
• Induced on-demand revival in coined quantum walks on infinite $d$-dimensional lattices
• Where to quantum walk
• Accelerated first detection in discrete-time quantum walks using sharp restarts
• Localization and Fractality in Inhomogeneous Quantum Walks with Self-Duality
• Monitored Recurrence of a One-parameter Family of Three-state Quantum Walks
• A characterization of orthogonal permutative matrices of order 4
• A generalization of Schur functions: applications to Nevanlinna functions, orthogonal polynomials, random walks and unitary and open quantum walks
• Return probability of quantum and correlated random walks