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:1405.7345 · Results in Physics

Quantum state revivals in quantum walks on cycles

Phillip R. Dukes

Published Jan 1, 2014• 33 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1016/j.rinp.2014.10.001

Related papers

Full revivals in 2D quantum walks

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

Recurrence of a random walk is described by the Pólya number. For quantum walks, recurrence is understood as the return of the walker to the origin, rather than the full revival of its quantum state. Localization for two-dimensional quantum walks is known to exist in the sense of non-vanishing probability distribution in the asymptotic limit. We show, on the example of the 2D Grover walk, that one can exploit the effect of localization to construct stationary solutions. Moreover, we find full revivals of a quantum state with a period of two steps. We prove that there cannot be longer cycles for a four-state quantum walk. Stationary states and revivals result from interference, which has no counterpart in classical random walks.

arXiv:1011.2066•Physica Scripta•Sep 1, 2010•24 citations

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

Full state revivals in higher dimensional quantum walks

Mahesh N. Jayakody, Asiri Nanayakkara

Abstract Full state revivals in a quantum walk can be viewed as returning of the walker to the initial quantum state in a periodic fashion during the propagation of the walk. In this paper we show that for any given number of spatial dimensions, a coin operator can be constructed to generate a quantum walk having full revivals with any desired period. From the point of view of quantum computation and simulations, these coin operators can be useful in implementing quantum walks, which oscillate between any two states with a finite periodicity.

arXiv:1806.07032•Physica Scripta•Dec 17, 2018•6 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

Monitored recurrence of a one-parameter family of three-state quantum walks

M. Štefaňák

Abstract Monitored recurrence of a one-parameter set of three-state quantum walks on a line is investigated. The calculations are considerably simplified by choosing a suitable basis of the coin space. We show that the Polya number (i.e. the site recurrence probability) depends on the coin parameter and the probability that the walker is initially in a particular coin state for which the walk returns to the origin with certainty. Finally, we present a brief investigation of the exact quantum state recurrence.

arXiv:2212.00540•Physica Scripta•Apr 21, 2023•2 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
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.
Recurrence of a random walk is described by the Pólya number. For quantum walks, recurrence is understood as the return of the walker to the origin, rather than the full revival of its quantum state. Localization for two-dimensional quantum walks is known to exist in the sense of non-vanishing probability distribution in the asymptotic limit. We show, on the example of the 2D Grover walk, that one can exploit the effect of localization to construct stationary solutions. Moreover, we find full revivals of a quantum state with a period of two steps. We prove that there cannot be longer cycles for a four-state quantum walk. Stationary states and revivals result from interference, which has no counterpart in classical random walks.
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.
Abstract Full state revivals in a quantum walk can be viewed as returning of the walker to the initial quantum state in a periodic fashion during the propagation of the walk. In this paper we show that for any given number of spatial dimensions, a coin operator can be constructed to generate a quantum walk having full revivals with any desired period. From the point of view of quantum computation and simulations, these coin operators can be useful in implementing quantum walks, which oscillate between any two states with a finite periodicity.
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.
Abstract Monitored recurrence of a one-parameter set of three-state quantum walks on a line is investigated. The calculations are considerably simplified by choosing a suitable basis of the coin space. We show that the Polya number (i.e. the site recurrence probability) depends on the coin parameter and the probability that the walker is initially in a particular coin state for which the walk returns to the origin with certainty. Finally, we present a brief investigation of the exact quantum state recurrence.
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.