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

arXiv:0805.1322 · Physical Review A

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

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

Published Sep 3, 2008• 78 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.78.032306

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

Induced on-demand revival in coined quantum walks on infinite d -dimensional lattices

Mahesh N. Jayakody, Ismael L. Paiva, Asiri Nanayakkara +1 more

The study of recurrences and revivals in quantum systems has attracted a great deal of interest because of its importance in the control of quantum systems and its potential use in developing new technologies. In this paper, we introduce a protocol to induce full-state revivals in a huge class of quantum walks on a $d$-dimensional lattice governed by a $c$-dimensional coin system. The protocol requires two repeated interventions in the coin degree of freedom. We also present a characterization of the walks that admit such a protocol. Moreover, we modify the quantity known as the P\'olya number, typically used in the study of recurrences in classical random walks and quantum walks, to create a witness of the first revival of the walk.

arXiv:2201.03307•Physical Review A•Mar 7, 2022•4 citations

Recurrences in three-state quantum walks on a plane

Bálint Kollár, M. Štefaňák, T. Kiss +1 more

We analyze the role of dimensionality in the time evolution of discrete-time quantum walks through the example of the three-state walk on a two-dimensional triangular lattice. We show that the three-state Grover walk does not lead to trapping (localization) or recurrence to the origin, in sharp contrast to the Grover walk on the two-dimensional square lattice. We determine the power-law scaling of the probability at the origin with the method of stationary phase. We prove that only a special subclass of coin operators can lead to recurrence, and there are no coins that lead to localization. The propagation for the recurrent subclass of coins is quasi-one dimensional.

arXiv:1005.0688•Physical Review A•Jul 6, 2010•30 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

Localization of two dimensional quantum walks defined by generalized Grover coins

Amrita Mandal, Rohit Sarma Sarkar, Bibhas Adhikari

Abstract Localization phenomena of quantum walks makes the propagation dynamics of a walker strikingly different from that corresponding to classical random walks. In this paper, we study the localization phenomena of four-state discrete-time quantum walks on two-dimensional lattices with coin operators as one-parameter orthogonal matrices that are also permutative, a combinatorial structure of the Grover matrix. We show that the proposed walks localize at its initial position for canonical initial coin states when the coin belongs to classes which contain the Grover matrix that we consider in this paper, however, the localization phenomena depends on the coin parameter when the class of parametric coins does not contain the Grover matrix.

arXiv:2103.00515•Journal of Physics A Mathematical and Theoretical•Jan 13, 2023•3 citations
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.
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.
The study of recurrences and revivals in quantum systems has attracted a great deal of interest because of its importance in the control of quantum systems and its potential use in developing new technologies. In this paper, we introduce a protocol to induce full-state revivals in a huge class of quantum walks on a ddd-dimensional lattice governed by a ccc-dimensional coin system. The protocol requires two repeated interventions in the coin degree of freedom. We also present a characterization of the walks that admit such a protocol. Moreover, we modify the quantity known as the P\'olya number, typically used in the study of recurrences in classical random walks and quantum walks, to create a witness of the first revival of the walk.
We analyze the role of dimensionality in the time evolution of discrete-time quantum walks through the example of the three-state walk on a two-dimensional triangular lattice. We show that the three-state Grover walk does not lead to trapping (localization) or recurrence to the origin, in sharp contrast to the Grover walk on the two-dimensional square lattice. We determine the power-law scaling of the probability at the origin with the method of stationary phase. We prove that only a special subclass of coin operators can lead to recurrence, and there are no coins that lead to localization. The propagation for the recurrent subclass of coins is quasi-one dimensional.
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.
Abstract Localization phenomena of quantum walks makes the propagation dynamics of a walker strikingly different from that corresponding to classical random walks. In this paper, we study the localization phenomena of four-state discrete-time quantum walks on two-dimensional lattices with coin operators as one-parameter orthogonal matrices that are also permutative, a combinatorial structure of the Grover matrix. We show that the proposed walks localize at its initial position for canonical initial coin states when the coin belongs to classes which contain the Grover matrix that we consider in this paper, however, the localization phenomena depends on the coin parameter when the class of parametric coins does not contain the Grover matrix.