aiqbench analysis
This is a pure-math classification result in discrete quantum walks. It determines exactly which Cayley graphs over finite abelian groups support perfect state transfer under Grover walks, extending earlier circulant-graph results. Its relevance to quantum readers is mainly theoretical: it maps which network structures can move quantum states perfectly, a constraint that matters for quantum walk algorithms and state-transfer protocols, but it does not yet indicate any hardware or application pathway.
A complete classification of perfect state transfer in Grover walks on abelian Cayley graphs
arXiv:2610.21946v1 Announce Type: cross Abstract: We completely classify connected Cayley graphs over finite abelian groups that exhibit perfect state transfer in Grover walks. First, we show that a Cayley graph over any finite group exhibiting perfect state transfer has valency $1$, $2$, or $4$. For valency $4$, we prove that an abelian Cayley graph $\operatorname{Cay}(\Gamma,S)$ exhibits perfect state transfer if and only if $S=\{a,-a,a+h,-a+h\}$, where $h$ has order $2$, and $4\nmid |\Gamma|/2$. Combining this characterization with the valency-one and valency-two cases, we explicitly determine all pairs $(\Gamma,S)$ for which $\operatorname{Cay}(\Gamma,S)$ exhibits perfect state transfer. Our results extend the classification of circulant graphs of valency at most four obtained by Kubota and Yoshino [Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks, \emph{J. Comb. Theory Ser. A.}, 216 (2025) 106064] to Cayley graphs over arbitrary finite abelian groups and to all valencies.
Abstract:We completely classify connected Cayley graphs over finite abelian groups that exhibit perfect state transfer in Grover walks. First, we show that a Cayley graph over any finite group exhibiting perfect state transfer has valency $1$, $2$, or $4$. For valency $4$, we prove that an abelian Cayley graph $\operatorname{Cay}(\Gamma,S)$ exhibits perfect state transfer if and only if $S=\{a,-a,a+h,-a+h\}$, where $h$ has order $2$, and $4\nmid |\Gamma|/2$. Combining this characterization with the valency-one and valency-two cases, we explicitly determine all pairs $(\Gamma,S)$ for which $\operatorname{Cay}(\Gamma,S)$ exhibits perfect state transfer. Our results extend the classification of circulant graphs of valency at most four obtained by Kubota and Yoshino [Circulant graphs with valency up to 4 that admit perfect state transfer in Grover walks, \emph{J. Comb. Theory Ser. A.}, 216 (2025) 106064] to Cayley graphs over arbitrary finite abelian groups and to all valencies.
Combinatorics (math.CO); Quantum Physics (quant-ph)
arXiv:2610.21946 [math.CO]
(or arXiv:2610.21946v1 [math.CO] for this version)
https://doi.org/10.48550/arXiv.2610.21946 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 238 words
Related coverage
Perfect state transfer in Grover walks on normal Cayley graphs
arXiv · Jul 22, 2026

Symmetry-enriched topological order in tensor networks: Defects, gauging and anyon condensation
Quantum Journal · Sep 1, 2026
Perfect state transfer and Cayley presentations
arXiv · Aug 24, 2026
Construction of Partial Join Graphs with Perfect State Transfer in Shunt Decomposition-Based Quantum Walks
arXiv · Sep 28, 2026