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:0808.2382 · International Journal of Quantum Information

MIXING OF QUANTUM WALKS ON GENERALIZED HYPERCUBES

Ana F. Best, Markus Kliegl, Shawn Mead-Gluchacki, Christino Tamon

Published Dec 1, 2008• 15 citations
arXivHTMLPDF

Abstract

We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform mixing on the hypercube is robust under the addition of perfect matchings but not much else. Our specific results include: • The graph obtained by augmenting the hypercube with an additive matching x ↦ x ⊕ η is instantaneous uniform mixing whenever |η| is even, but with a slower mixing time. This strictly includes the result of Moore and Russell1on the hypercube. • The class of Hamming graphs H(n,q) is not uniform mixing if and only if q ≥ 5. This is a tight characterization of quantum uniform mixing on Hamming graphs; previously, only the status of H(n,q) with q < 5 was known. • The bunkbed graph [Formula: see text] whose adjacency matrix is I ⊗ Qn+ X ⊗ Af, where Afis a [Formula: see text]-circulant matrix defined by a Boolean function f, is not uniform mixing if the Fourier transform of f has support of size smaller than 2n-1. This explains why the hypercube is uniform mixing and why the join of two hypercubes is not. Our work exploits the rich spectral structure of the generalized hypercubes and relies heavily on Fourier analysis of group-circulants.

DOI
10.1142/s0219749908004377

Related papers

On mixing in continuous-time quantum walks on some circulant graphs

A. Ahmadi, Ryan Belk, Christino Tamon +1 more

Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that the continuous-time quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs that have the instantaneous exactly uniform mixing property are the complete graphs on two, three and four vertices, and the cycle graph on four vertices. Our proof exploits the circulant structure of these graphs. Furthermore, we conjecture that most complete cycles and Cayley graphs of the symmetric group lack this mixing property as well.

Quantum Information and Computation•Nov 1, 2003•51 citations

Mixing of quantum walk on circulant bunkbeds

P. Lo, Siddharth Rajaram, Diana R. Schepens +3 more

This paper gives new observations on the mixing dynamics of a continuous-time quantum walk on circulants and their bunkbeds. These bunkbeds are defined through two standard graph operators: the join G + H and the Cartesian product G \cprod H of graphs G and H. Our results include the following: (i) The quantum walk is average uniform mixing on circulants with bounded eigenvalue multiplicity; this extends a known fact about the cycles C_{n}. (ii) Explicit analysis of the probability distribution of the quantum walk on the join of circulants; this explains why complete multipartite graphs are not average uniform mixing, using the fact K_{n} = K_{1} + K_{n-1} and K_{n,\ldots,n} = \overline{K}_{n} + \ldots + \overline{K}_{n}. (iii) The quantum walk on the Cartesian product of a $m$-vertex path P_{m} and a circulant G, namely, P_{m} \cprod G, is average uniform mixing if G is; this highlights a difference between circulants and the hypercubes Q_{n} = P_{2} \cprod Q_{n-1}. Our proofs employ purely elementary arguments based on the spectra of the graphs.

arXiv:quant-ph/0509059•Quantum Information and Computation•Jul 1, 2006•11 citations

A note on graphs resistant to quantum uniform mixing

William Adamczak, Kevin Andrew, Peter Hernberg +1 more

Continuous-time quantum walks on graphs is a generalization of continuous-time Markov chains on discrete structures. Moore and Russell proved that the continuous-time quantum walk on the $n$-cube is instantaneous exactly uniform mixing but has no average mixing property. On complete (circulant) graphs $K_{n}$, the continuous-time quantum walk is neither instantaneous (except for $n=2,3,4$) nor average uniform mixing (except for $n=2$). We explore two natural {\em group-theoretic} generalizations of the $n$-cube as a $G$-circulant and as a bunkbed $G \rtimes \Int_{2}$, where $G$ is a finite group. Analyses of these classes suggest that the $n$-cube might be special in having instantaneous uniform mixing and that non-uniform average mixing is pervasive, i.e., no memoryless property for the average limiting distribution; an implication of these graphs having zero spectral gap. But on the bunkbeds, we note a memoryless property with respect to the two partitions. We also analyze average mixing on complete paths, where the spectral gaps are nonzero.

arXiv:quant-ph/0308073•Aug 13, 2003•24 citations

Mixing in Continuous Quantum Walks on Graphs

Ahmadi, Amir, Ryan Belk, Christino Tamon +1 more

Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs that have the instantaneous uniform mixing property are the complete graphs on two, three and four vertices, and the cycle graph on four vertices. Our proof exploits the circulant structure of these graphs. Furthermore, we conjecture that most complete cycles and Cayley graphs lack this mixing property as well.

arXiv:quant-ph/0209106•Sep 18, 2002•17 citations

NON-UNIFORM MIXING OF QUANTUM WALK ON CYCLES

William Adamczak, Kevin Andrew, Leon Bergen +4 more

A classical lazy random walk on cycles is known to mix with the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibits strong non-uniform mixing properties. First, we prove that the instantaneous distribution of a quantum walk on most even-length cycles is never uniform. More specifically, we prove that a quantum walk on a cycle Cnis not instantaneous uniform mixing, whenever n satisfies either: (a) n = 2u, for u ≥ 3; or (b) n = 2uq, for u ≥ 1 and q ≡ 3 (mod 4). Second, we prove that the average distribution of a quantum walk on any Abelian circulant graph is never uniform. As a corollary, the average distribution of a quantum walk on any standard circulant graph, such as the cycles, complete graphs, and even hypercubes, is never uniform. Nevertheless, we show that the average distribution of a quantum walk on the cycle Cnis O(1/n)-uniform.

arXiv:0708.2096•International Journal of Quantum Information•Dec 1, 2007•29 citations

Uniform Mixing in Chiral Quantum Walks

Luke Levine, Jessy Jacob Mesapam, Benjamin Mustico +3 more

This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing $σ$, the complete graph $K^σ_n$ has probabilistic uniform mixing. In contrast, Ahmadi \etal (2003) proved that no complete graph has uniform mixing except for $K_2$, $K_3$, and $K_4$. Our technique is based on a stopping rule for quantum walks which reduces global to local uniform mixing. As a corollary, we found an orientation of $H(n,4)$ that mixes to uniform faster than any other Hamming graphs, which improves a result of Godsil and Zhan (2019). We also show that there are infinite families of oriented circulants with average uniform mixing. This is a chiral violation of a No-Go theorem due to Godsil (2013) which states that no graph has average uniform mixing except for $K_2$.

math.COCross-listedarXiv:2605.04414•May 7, 2026•0 citations
We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform mixing on the hypercube is robust under the addition of perfect matchings but not much else. Our specific results include: • The graph obtained by augmenting the hypercube with an additive matching x ↦ x ⊕ η is instantaneous uniform mixing whenever |η| is even, but with a slower mixing time. This strictly includes the result of Moore and Russell1on the hypercube. • The class of Hamming graphs H(n,q) is not uniform mixing if and only if q ≥ 5. This is a tight characterization of quantum uniform mixing on Hamming graphs; previously, only the status of H(n,q) with q < 5 was known. • The bunkbed graph [Formula: see text] whose adjacency matrix is I ⊗ Qn+ X ⊗ Af, where Afis a [Formula: see text]-circulant matrix defined by a Boolean function f, is not uniform mixing if the Fourier transform of f has support of size smaller than 2n-1. This explains why the hypercube is uniform mixing and why the join of two hypercubes is not. Our work exploits the rich spectral structure of the generalized hypercubes and relies heavily on Fourier analysis of group-circulants.
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that the continuous-time quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs that have the instantaneous exactly uniform mixing property are the complete graphs on two, three and four vertices, and the cycle graph on four vertices. Our proof exploits the circulant structure of these graphs. Furthermore, we conjecture that most complete cycles and Cayley graphs of the symmetric group lack this mixing property as well.
This paper gives new observations on the mixing dynamics of a continuous-time quantum walk on circulants and their bunkbeds. These bunkbeds are defined through two standard graph operators: the join G + H and the Cartesian product G \cprod H of graphs G and H. Our results include the following: (i) The quantum walk is average uniform mixing on circulants with bounded eigenvalue multiplicity; this extends a known fact about the cycles C_{n}. (ii) Explicit analysis of the probability distribution of the quantum walk on the join of circulants; this explains why complete multipartite graphs are not average uniform mixing, using the fact K_{n} = K_{1} + K_{n-1} and K_{n,\ldots,n} = \overline{K}_{n} + \ldots + \overline{K}_{n}. (iii) The quantum walk on the Cartesian product of a mmm-vertex path P_{m} and a circulant G, namely, P_{m} \cprod G, is average uniform mixing if G is; this highlights a difference between circulants and the hypercubes Q_{n} = P_{2} \cprod Q_{n-1}. Our proofs employ purely elementary arguments based on the spectra of the graphs.
Continuous-time quantum walks on graphs is a generalization of continuous-time Markov chains on discrete structures. Moore and Russell proved that the continuous-time quantum walk on the nnn-cube is instantaneous exactly uniform mixing but has no average mixing property. On complete (circulant) graphs KnK_{n}Kn​, the continuous-time quantum walk is neither instantaneous (except for n=2,3,4n=2,3,4n=2,3,4) nor average uniform mixing (except for n=2n=2n=2). We explore two natural {\em group-theoretic} generalizations of the nnn-cube as a GGG-circulant and as a bunkbed $G \rtimes \Int_{2}$, where GGG is a finite group. Analyses of these classes suggest that the nnn-cube might be special in having instantaneous uniform mixing and that non-uniform average mixing is pervasive, i.e., no memoryless property for the average limiting distribution; an implication of these graphs having zero spectral gap. But on the bunkbeds, we note a memoryless property with respect to the two partitions. We also analyze average mixing on complete paths, where the spectral gaps are nonzero.
Classical random walks on well-behaved graphs are rapidly mixing towards the uniform distribution. Moore and Russell showed that a continuous quantum walk on the hypercube is instantaneously uniform mixing. We show that the continuous-time quantum walks on other well-behaved graphs do not exhibit this uniform mixing. We prove that the only graphs amongst balanced complete multipartite graphs that have the instantaneous uniform mixing property are the complete graphs on two, three and four vertices, and the cycle graph on four vertices. Our proof exploits the circulant structure of these graphs. Furthermore, we conjecture that most complete cycles and Cayley graphs lack this mixing property as well.
A classical lazy random walk on cycles is known to mix with the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibits strong non-uniform mixing properties. First, we prove that the instantaneous distribution of a quantum walk on most even-length cycles is never uniform. More specifically, we prove that a quantum walk on a cycle Cnis not instantaneous uniform mixing, whenever n satisfies either: (a) n = 2u, for u ≥ 3; or (b) n = 2uq, for u ≥ 1 and q ≡ 3 (mod 4). Second, we prove that the average distribution of a quantum walk on any Abelian circulant graph is never uniform. As a corollary, the average distribution of a quantum walk on any standard circulant graph, such as the cycles, complete graphs, and even hypercubes, is never uniform. Nevertheless, we show that the average distribution of a quantum walk on the cycle Cnis O(1/n)-uniform.
This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing σσσ, the complete graph KnσK^σ_nKnσ​ has probabilistic uniform mixing. In contrast, Ahmadi \etal (2003) proved that no complete graph has uniform mixing except for K2K_2K2​, K3K_3K3​, and K4K_4K4​. Our technique is based on a stopping rule for quantum walks which reduces global to local uniform mixing. As a corollary, we found an orientation of H(n,4)H(n,4)H(n,4) that mixes to uniform faster than any other Hamming graphs, which improves a result of Godsil and Zhan (2019). We also show that there are infinite families of oriented circulants with average uniform mixing. This is a chiral violation of a No-Go theorem due to Godsil (2013) which states that no graph has average uniform mixing except for K2K_2K2​.