Uniform Mixing on Cayley Graphs
Chris Godsil, Hanmeng Zhan

TL;DR
This paper characterizes specific Cayley graphs over finite groups that exhibit uniform quantum mixing, introduces new constructions for such graphs, and identifies the first irregular graphs with this property.
Contribution
It provides a complete characterization of certain regular Cayley graphs over 7d_3^d and constructs new Cayley graphs over 7d_q^d with uniform mixing at specified times.
Findings
Characterization of all 2(d+2)-regular Cayley graphs over 7d_3^d with uniform mixing at 2c/9
Construction of Cayley graphs over 7d_q^d with uniform mixing at 2c/q^k for q=3,4
Identification of the first irregular graphs, Cartesian powers of K_{1,3}, with uniform mixing
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 -regular Cayley graphs over that admit uniform mixing at time . Our second result shows that for every integer , we can construct Cayley graphs over that admit uniform mixing at time , where . We also find the first family of irregular graphs, the Cartesian powers of the star , that admit uniform mixing.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
