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

Physica Scripta

Comment on ‘Full revivals in 2D quantum walks’

Randika Dodangodage, Asiri Nanayakkara

Published Sep 21, 2018• 0 citations
Publisher

Abstract

Abstract In the paper Štefaňák et al (2010 Phys. Scr. T 140 014035) have proved that for any four-state quantum walk, there cannot be cycles longer than two steps. Our investigations reveal that they have not used the most general form of characteristic polynomials in their proof. Consequently, the result is not generally valid and hence there can be quantum walks having cycles longer than two steps.

DOI
10.1088/1402-4896/aae34b

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

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

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

Periodicity for the Hadamard Walk on Cycles

Norio Konno, Yuki Shimizu, Masato Takei

The present paper treats the period TN of the Hadamard walk on a cycle CN with N vertices. Dukes (2014) considered the periodicity of more general quantum walks on CN and showed T2=2, T4=8, T8=24 for the Hadamard walk case. We prove that the Hadamard walk does not have any period except for his case, i.e., N = 2,4,8. Our method is based on a path counting and cyclotomic polynomials which is different from his approach based on the property of eigenvalues for unitary matrix that determines the evolution of the walk.

arXiv:1504.06396•Interdisciplinary Information Sciences•Jan 1, 2017•18 citations

The fog on: Generalized teleportation by means of discrete-time quantum walks on N-lines and N-cycles

Duc Manh Nguyen, Sunghwan Kim

The recent paper entitled “Generalized teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles” by Yang et al. [Mod. Phys. Lett. B 33(6) (2019) 1950069] proposed the quantum teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles. However, further investigation shows that the quantum walk over the one-dimensional infinite line can be based over the [Formula: see text]-cycles and cannot be based on [Formula: see text]-lines. The proofs of our claims on quantum walks based on finite lines are also provided in detail.

Modern Physics Letters B•Aug 5, 2019•9 citations

Quantum walks on graphs

Dorit Aharonov, Andris Ambainis, Julia Kempe +1 more

We set the ground for a theory of quantum walks on graphs-the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible. However, by suitably relaxing the definition, we can obtain a measure of how fast the quantum walk spreads or how confined the quantum walk stays in a small neighborhood. We give definitions of mixing time, filling time, dispersion time. We show that in all these measures, the quantum walk on the cycle is almost quadratically faster then its classical correspondent. On the other hand, we give a lower bound on the possible speed up by quantum walks for general graphs, showing that quantum walks can be at most polynomially faster than their classical counterparts.

ACM Symposium on Theory of Computing (STOC)•Jul 6, 2001•638 citations
Abstract In the paper Štefaňák et al (2010 Phys. Scr. T 140 014035) have proved that for any four-state quantum walk, there cannot be cycles longer than two steps. Our investigations reveal that they have not used the most general form of characteristic polynomials in their proof. Consequently, the result is not generally valid and hence there can be quantum walks having cycles longer than two steps.
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.
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 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 present paper treats the period TN of the Hadamard walk on a cycle CN with N vertices. Dukes (2014) considered the periodicity of more general quantum walks on CN and showed T2=2, T4=8, T8=24 for the Hadamard walk case. We prove that the Hadamard walk does not have any period except for his case, i.e., N = 2,4,8. Our method is based on a path counting and cyclotomic polynomials which is different from his approach based on the property of eigenvalues for unitary matrix that determines the evolution of the walk.
The recent paper entitled “Generalized teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles” by Yang et al. [Mod. Phys. Lett. B 33(6) (2019) 1950069] proposed the quantum teleportation by means of discrete-time quantum walks on [Formula: see text]-lines and [Formula: see text]-cycles. However, further investigation shows that the quantum walk over the one-dimensional infinite line can be based over the [Formula: see text]-cycles and cannot be based on [Formula: see text]-lines. The proofs of our claims on quantum walks based on finite lines are also provided in detail.
We set the ground for a theory of quantum walks on graphs-the generalization of random walks on finite graphs to the quantum world. Such quantum walks do not converge to any stationary distribution, as they are unitary and reversible. However, by suitably relaxing the definition, we can obtain a measure of how fast the quantum walk spreads or how confined the quantum walk stays in a small neighborhood. We give definitions of mixing time, filling time, dispersion time. We show that in all these measures, the quantum walk on the cycle is almost quadratically faster then its classical correspondent. On the other hand, we give a lower bound on the possible speed up by quantum walks for general graphs, showing that quantum walks can be at most polynomially faster than their classical counterparts.