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:1811.03235 · Quantum Information and Computation

Periodicity for the Fourier quantum walk on regular graphs

Kei Saito

Published Feb 1, 2019• 10 citations
arXivHTMLPDF

Abstract

Quantum walks determined by the coin operator on graphs have been intensively studied. The typical examples of coin operator are the Grover and Fourier matrices. The periodicity of the Grover walk is well investigated. However, the corresponding result on the Fourier walk is not known. In this paper, we present a necessary condition for the Fourier walk on regular graphs to have the finite period. As an application of our result, we show that the Fourier walks do not have any finite period for some classes of regular graphs such as complete graphs, cycle graphs with selfloops, and hypercubes.

DOI
10.26421/qic19.1-2-3

Related papers

Periodicity for the 3-state quantum walk on cycles

Takeshi Kajiwara, Norio Konno, Shohei Koyama +1 more

Dukes (2014) and Konno, Shimizu, and Takei (2017) studied the periodicity for 2-state quantum walks whose coin operator is the Hadamard matrix on cycle graph C_N with N vertices. The present paper treats the periodicity for 3-state quantum walks on C_N. Our results follow from a new method based on the cyclotomic field. This method gives a necessary condition for the coin operator for quantum walks to be periodic. Moreover, we reveal the period T_N of typical two kinds of quantum walks, the Grover and Fourier walks. We prove that both walks do not have any finite period except for N=3, in which case T_3=6 (Grover), =12 (Fourier).

arXiv:1907.01725•Quantum Information and Computation•Nov 1, 2019•12 citations

Periodicity of bipartite walk on biregular graphs with conditional spectra

Qiuting Chen

Abstract In this paper we study a class of discrete quantum walks, known as bipartite walks. These include the well-known Grover’s walks. A discrete quantum walk is given by the powers of a unitary matrix U indexed by arcs or edges of the underlying graph. The walk is periodic if U k = I for some positive integer k. Kubota has given a characterization of periodicity of Grover’s walk when the walk is defined on a regular bipartite graph with at most five eigenvalues. We extend Kubota’s results—if a biregular graph G has eigenvalues whose squares are algebraic integers with degree at most two, we characterize periodicity of the bipartite walk over G in terms of its spectrum. We apply periodicity results of bipartite walks to get a characterization of periodicity of Grover’s walk on regular graphs.

arXiv:2211.02752•Physica Scripta•Aug 21, 2024•5 citations

Entanglement in coined quantum walks on regular graphs

Ivens Carneiro, Meng Loo, Xibai Xu +3 more

Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the entanglement between the coin and the position of the particle by calculating the entropy of the reduced density matrix of the coin. We consider both dynamical evolution and asymptotic limits for coins of dimensions from two to eight on regular graphs. For low coin dimensions, quantum walks which spread faster (as measured by the mean square deviation of their distribution from uniform) also exhibit faster convergence towards the asymptotic value of the entanglement between the coin and particle's position. For high-dimensional coins, the DFT coin operator is more efficient at spreading than the Grover coin. We study the entanglement of the coin on regular finite graphs such as cycles, and also show that on complete bipartite graphs, a quantum walk with a Grover coin is always periodic with period four. We generalize the 'glued trees' graph used by Childs et al (2003 Proc. STOC , pp 59–68) to higher branching rate (fan out) and verify that the scaling with branching rate and with tree depth is polynomial.

arXiv:quant-ph/0504042•New Journal of Physics•Jul 12, 2005•140 citations

Periodicity and absolute zeta functions of multi-state grover walks on cycles

Jirô Akahori, Norio Konno, Iwao Sato +1 more

Quantum walks, the quantum counterpart of classical random walks, are extensively studied for their applications in mathematics, quantum physics, and quantum information science. This study explores the periods and absolute zeta functions of Grover walks on cycle graphs. Specifically, we investigate Grover walks with an odd number of states and determine their periods for cycles with any number of vertices greater than or equal to two. In addition, we compute the absolute zeta functions of M-type Grover walks with finite periods. These results advance the understanding of the properties of Grover walks and their connection to absolute zeta functions.

arXiv:2501.18600•International Journal of Quantum Information•Mar 1, 2025•1 citation

A Characterization of the Graphs to Induce Periodic Grover Walk

Yusuke Yoshie

This paper explains the periodicity of the Grover walk on finite graphs. We characterize the graphs to induce 2, 3, 4, 5-periodic Grover walk and obtain a necessary condition of the graphs to induce an odd-periodic Grover walk.

arXiv:1703.06286•Mar 18, 2017•6 citations

Grover walks on unitary Cayley graphs and integral regular graphs

Koushik Bhakta, Bikash Bhattacharjya

The unitary Cayley graph has vertex set $\{0,1, \hdots ,n-1\}$, where two vertices $u$ and $v$ are adjacent if $\gcd(u - v, n) = 1$. In this paper, we study periodicity and perfect state transfer of Grover walks on the unitary Cayley graphs. We characterize all periodic unitary Cayley graphs. We prove that periodicity is a necessary condition for occurrence of perfect state transfer on a vertex-transitive graph. Also, we provide a necessary and sufficient condition for the occurrence of perfect state transfer on circulant graphs. Using these, we prove that only four graphs in the class of unitary Cayley graphs exhibit perfect state transfer. Also, we provide a spectral characterization of the periodicity of Grover walks on integral regular graphs.

arXiv:2405.01020•May 2, 2024•10 citations
Quantum walks determined by the coin operator on graphs have been intensively studied. The typical examples of coin operator are the Grover and Fourier matrices. The periodicity of the Grover walk is well investigated. However, the corresponding result on the Fourier walk is not known. In this paper, we present a necessary condition for the Fourier walk on regular graphs to have the finite period. As an application of our result, we show that the Fourier walks do not have any finite period for some classes of regular graphs such as complete graphs, cycle graphs with selfloops, and hypercubes.
Dukes (2014) and Konno, Shimizu, and Takei (2017) studied the periodicity for 2-state quantum walks whose coin operator is the Hadamard matrix on cycle graph C_N with N vertices. The present paper treats the periodicity for 3-state quantum walks on C_N. Our results follow from a new method based on the cyclotomic field. This method gives a necessary condition for the coin operator for quantum walks to be periodic. Moreover, we reveal the period T_N of typical two kinds of quantum walks, the Grover and Fourier walks. We prove that both walks do not have any finite period except for N=3, in which case T_3=6 (Grover), =12 (Fourier).
Abstract In this paper we study a class of discrete quantum walks, known as bipartite walks. These include the well-known Grover’s walks. A discrete quantum walk is given by the powers of a unitary matrix U indexed by arcs or edges of the underlying graph. The walk is periodic if U k = I for some positive integer k. Kubota has given a characterization of periodicity of Grover’s walk when the walk is defined on a regular bipartite graph with at most five eigenvalues. We extend Kubota’s results—if a biregular graph G has eigenvalues whose squares are algebraic integers with degree at most two, we characterize periodicity of the bipartite walk over G in terms of its spectrum. We apply periodicity results of bipartite walks to get a characterization of periodicity of Grover’s walk on regular graphs.
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the entanglement between the coin and the position of the particle by calculating the entropy of the reduced density matrix of the coin. We consider both dynamical evolution and asymptotic limits for coins of dimensions from two to eight on regular graphs. For low coin dimensions, quantum walks which spread faster (as measured by the mean square deviation of their distribution from uniform) also exhibit faster convergence towards the asymptotic value of the entanglement between the coin and particle's position. For high-dimensional coins, the DFT coin operator is more efficient at spreading than the Grover coin. We study the entanglement of the coin on regular finite graphs such as cycles, and also show that on complete bipartite graphs, a quantum walk with a Grover coin is always periodic with period four. We generalize the 'glued trees' graph used by Childs et al (2003 Proc. STOC , pp 59–68) to higher branching rate (fan out) and verify that the scaling with branching rate and with tree depth is polynomial.
Quantum walks, the quantum counterpart of classical random walks, are extensively studied for their applications in mathematics, quantum physics, and quantum information science. This study explores the periods and absolute zeta functions of Grover walks on cycle graphs. Specifically, we investigate Grover walks with an odd number of states and determine their periods for cycles with any number of vertices greater than or equal to two. In addition, we compute the absolute zeta functions of M-type Grover walks with finite periods. These results advance the understanding of the properties of Grover walks and their connection to absolute zeta functions.
The unitary Cayley graph has vertex set $\{0,1, \hdots ,n-1\}$, where two vertices uuu and vvv are adjacent if gcd⁡(u−v,n)=1\gcd(u - v, n) = 1gcd(u−v,n)=1. In this paper, we study periodicity and perfect state transfer of Grover walks on the unitary Cayley graphs. We characterize all periodic unitary Cayley graphs. We prove that periodicity is a necessary condition for occurrence of perfect state transfer on a vertex-transitive graph. Also, we provide a necessary and sufficient condition for the occurrence of perfect state transfer on circulant graphs. Using these, we prove that only four graphs in the class of unitary Cayley graphs exhibit perfect state transfer. Also, we provide a spectral characterization of the periodicity of Grover walks on integral regular graphs.