Abstract
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.
Reference29 articles.
1. Quantum speed-up of Markov chain based algorithms;Szegedy,2004
2. Exponential algorithmic speedup by quantum walk;Childs,2002
3. Average mixing of continuous quantum walks;Godsil;J. Comb. Theory A,2013
4. When can perfect state transfer occur?;Godsil;Electronic Journal of Linear Algebra,2012
5. Periodicity for the Hadamard walk on cycles;Konno,2015