2000 character limit reached
Uniform Mixing on Cayley Graphs
Published 3 Apr 2015 in math.CO | (1504.00721v3)
Abstract: We provide new examples of Cayley graphs on which the quantum walks reach uniform mixing. Our first result is a complete characterization of all $2(d+2)$-regular Cayley graphs over $\mathbb{Z}3d$ that admit uniform mixing at time $2\pi/9$. Our second result shows that for every integer $k\ge 3$, we can construct Cayley graphs over $\mathbb{Z}_qd$ that admit uniform mixing at time $2\pi/qk$, where $q=3, 4$. We also find the first family of irregular graphs, the Cartesian powers of the star $K{1,3}$, that admit uniform mixing.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.