Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research establishes rigorous mathematical conditions for perfect state transfer within Grover walks, a fundamental model of discrete-time quantum dynamics on normal Cayley graphs. By deriving explicit spectral criteria across various group structures like dihedral and dicyclic groups, the study identifies specific infinite families where ideal information transport is possible without external control fields. These findings advance our theoretical understanding of how graph symmetry dictates quantum coherence limits in structured networks.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Perfect state transfer in Grover walks on normal Cayley graphs

arXiv3 min read

arXiv:2607.19309v1 Announce Type: new Abstract: A Cayley graph $\operatorname{Cay}(\Gamma,S)$ over a finite group $\Gamma$ is said to be normal if its connection set $S$ is a union of some conjugacy classes of $\Gamma$. This paper investigates perfect state transfer in Grover walks on normal Cayley graphs. The Grover walk is a widely studied discrete-time quantum walk. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on normal Cayley graphs. As applications, we derive explicit spectral criteria for perfect state transfer on Cayley graphs over abelian groups, dicyclic groups, and dihedral groups. These results yield several infinite families of Cayley graphs exhibiting perfect state transfer. We further obtain simple combinatorial characterizations of the existence of perfect state transfer on Cayley graphs over dihedral and dicyclic groups. Our general characterization also recovers a number of previously known results as special cases. As a further consequence, we obtain a complete characterization of perfect state transfer on unitary Cayley graphs. In particular, we prove that exactly four graphs in the class of unitary Cayley graphs exhibit perfect state transfer.

Abstract:A Cayley graph $\operatorname{Cay}(\Gamma,S)$ over a finite group $\Gamma$ is said to be normal if its connection set $S$ is a union of some conjugacy classes of $\Gamma$. This paper investigates perfect state transfer in Grover walks on normal Cayley graphs. The Grover walk is a widely studied discrete-time quantum walk. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on normal Cayley graphs. As applications, we derive explicit spectral criteria for perfect state transfer on Cayley graphs over abelian groups, dicyclic groups, and dihedral groups. These results yield several infinite families of Cayley graphs exhibiting perfect state transfer. We further obtain simple combinatorial characterizations of the existence of perfect state transfer on Cayley graphs over dihedral and dicyclic groups. Our general characterization also recovers a number of previously known results as special cases. As a further consequence, we obtain a complete characterization of perfect state transfer on unitary Cayley graphs. In particular, we prove that exactly four graphs in the class of unitary Cayley graphs exhibit perfect state transfer.

Quantum Physics (quant-ph); Combinatorics (math.CO)

arXiv:2607.19309 [quant-ph]

(or arXiv:2607.19309v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2607.19309 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 · 271 words

Related coverage