Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Quantum Information

Recurrences in Quantum Walks

M. Štefaňák, Igor Jex, T. Kiss

Published Jan 1, 2008• 0 citations
Publisher

Abstract

We analyze the recurrence probabilities (Pólya numbers) of quantum walks. We show that one can achieve strikingly different recurrence behaviours for quantum walks by altering the coin and the initial state.
DOI
10.1364/icqi.2008.jmb55

Related papers

Recurrence and Pólya Number of Quantum Walks

M. Štefaňák, Igor Jex, T. Kiss

We analyze the recurrence probability (Pólya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localization of quantum walks. In contrast with classical walks, where the Pólya number is characteristic for the given dimension, the recurrence probability of a quantum walk depends in general on the topology of the walk, choice of the coin and the initial state. This allows us to change the character of the quantum walk from recurrent to transient by altering the initial state.

arXiv:0705.1991•Physical Review Letters•Jan 14, 2008•118 citations

Recurrence in coined quantum walks

T. Kiss, L. Kecskés, M. Štefaňák +1 more

Recurrence of quantum walks on lattices can be characterized by the generalized Pólya number. Its value reflects the difference between a classical and a quantum system. The dimension of the lattice is not a unique parameter in the quantum case; both the coin operator and the initial quantum state of the coin influence the recurrence in a nontrivial way. In addition, the definition of the Pólya number involves measurement of the system. Depending on how measurement is included in the definition, the recurrence properties vary. We show that in the limiting case of frequent, strong measurements, one can approach the classical dynamics. Comparing various cases, we have found numerical indication that our previous definition of the Pólya number provides an upper limit.

Physica Scripta•Jul 1, 2009•8 citations

Quantum state revivals in quantum walks on cycles

Phillip R. Dukes

Recurrence in the classical random walk is well known and described by the Pólya number. For quantum walks, recurrence is similarly understood in terms of the probability of a localized quantum walker to return to its origin. Under certain circumstances the quantum walker may also return to an arbitrary initial quantum state in a finite number of steps. Quantum state revivals in quantum walks on cycles using coin operators which are constant in time and uniform across the path have been described before but only incompletely. In this paper we find the general conditions for which full-quantum state revival will occur.

arXiv:1405.7345•Results in Physics•Jan 1, 2014•33 citations

Quantum walks - types and properties

Igor Jex, M. Štefaňák, T. Kiss

We review properties of quantum walks with one and two excitations. The Polya number concept is applied to quantum walks and used for their classification. Quantum walks with random errors leading to localization are discussed.

International Conference on Quantum Information•Jan 1, 2008•0 citations

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

M. Štefaňák, T. Kiss, Igor Jex

The P\'olya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. \ifmmode \check{S}\else \v{S}\fi{}tefa\ifmmode \check{n}\else \v{n}\fi{}\'ak et al., Phys. Rev. Lett. 100, 020501 (2008)] which is based on a specific measurement scheme. The P\'olya 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 Hadamard tensor-product coins, the P\'olya number is independent of the initial conditions and the actual coin operators, thus resembling the property of the classical walks. We provide an estimation of the P\'olya number for this class of quantum walks. Second, we examine the two-dimensional Grover walk, which exhibits localization 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 classical walks which are recurrent only for the dimensions $d=1,2$. Finally, we analyze the recurrence of the 2D Fourier walk. This quantum walk is recurrent except for a two-dimensional subspace of the initial states. We provide an estimation of the P\'olya number in its dependence on the initial state.

arXiv:0805.1322•Physical Review A•Sep 3, 2008•78 citations

Controlling discrete quantum walks: coins and initial states

Ben Tregenna, W. Flanagan, Rik Maile +1 more

In discrete time, coined quantum walks, the coin degrees of freedom offer the potential for a wider range of controls over the evolution of the walk than are available in the continuous time quantum walk. This paper explores some of the possibilities on regular graphs, and also reports periodic behaviour on small cyclic graphs.

arXiv:quant-ph/0304204•New Journal of Physics•Jul 2, 2003•264 citations
We analyze the recurrence probability (Pólya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localization of quantum walks. In contrast with classical walks, where the Pólya number is characteristic for the given dimension, the recurrence probability of a quantum walk depends in general on the topology of the walk, choice of the coin and the initial state. This allows us to change the character of the quantum walk from recurrent to transient by altering the initial state.
Recurrence of quantum walks on lattices can be characterized by the generalized Pólya number. Its value reflects the difference between a classical and a quantum system. The dimension of the lattice is not a unique parameter in the quantum case; both the coin operator and the initial quantum state of the coin influence the recurrence in a nontrivial way. In addition, the definition of the Pólya number involves measurement of the system. Depending on how measurement is included in the definition, the recurrence properties vary. We show that in the limiting case of frequent, strong measurements, one can approach the classical dynamics. Comparing various cases, we have found numerical indication that our previous definition of the Pólya number provides an upper limit.
Recurrence in the classical random walk is well known and described by the Pólya number. For quantum walks, recurrence is similarly understood in terms of the probability of a localized quantum walker to return to its origin. Under certain circumstances the quantum walker may also return to an arbitrary initial quantum state in a finite number of steps. Quantum state revivals in quantum walks on cycles using coin operators which are constant in time and uniform across the path have been described before but only incompletely. In this paper we find the general conditions for which full-quantum state revival will occur.
The P\'olya number characterizes the recurrence of a random walk. We apply the generalization of this concept to quantum walks [M. \ifmmode \check{S}\else \v{S}\fi{}tefa\ifmmode \check{n}\else \v{n}\fi{}\'ak et al., Phys. Rev. Lett. 100, 020501 (2008)] which is based on a specific measurement scheme. The P\'olya 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 Hadamard tensor-product coins, the P\'olya number is independent of the initial conditions and the actual coin operators, thus resembling the property of the classical walks. We provide an estimation of the P\'olya number for this class of quantum walks. Second, we examine the two-dimensional Grover walk, which exhibits localization 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 classical walks which are recurrent only for the dimensions d=1,2d=1,2d=1,2. Finally, we analyze the recurrence of the 2D Fourier walk. This quantum walk is recurrent except for a two-dimensional subspace of the initial states. We provide an estimation of the P\'olya number in its dependence on the initial state.