Skip to content
Review

Perfect state transfer and Cayley presentations

Aug 2026 · 0 citations · 46 references
Mathematics Physics

Abstract

We study perfect state transfer on Cayley graphs from the point of view that state transfer is a property of a graph and not of a group. This paper is a bridge between the classical question about isomorphic Cayley graphs of non-isomorphic groups and quantum walks on graphs. We show that a Cayley graph of a group with an abelian subgroup of index two is a Cayley graph of an abelian group under any one of three hypotheses, two drawn from the theory of isomorphic Cayley graphs. A statement of the same kind holds for extraspecial groups: every Cayley graph of an extraspecial $p$-group of order $p^{2n+1}$ with a conjugacy-closed connection set is a Cayley graph of $Z_p^{2n+1}$. From these results we deduce that every explicit construction of perfect state transfer in the six papers we survey, on dihedral, dicyclic, generalized dihedral, $V_{8n}$ and extraspecial $2$-groups, is a non-abelian presentation of an abelian Cayley graph. Moreover, we show that a non-abelian group with an abelian subgroup of index two admits a connected Cayley graph with perfect state transfer if and only if its order is divisible by four. Genuinely non-abelian examples do exist. We prove that, for every odd prime power $q\ge 5$, the $SL(2,q)$ graph of Pantangi and Sin, which they showed to admit perfect state transfer, is a Cayley graph of no abelian group; to our knowledge, this is the first infinite family of Cayley graphs with perfect state transfer provably admitting no abelian Cayley presentation. We also construct an infinite family of Cayley graphs with peak state transfer and determine all regular subgroups of the automorphism group of every member. An appendix records a census of the connected vertex-transitive graphs with perfect state transfer on at most $30$ vertices.

View source

Similar papers

Preprint Aug 2026

Perfect state transfer on Cayley graphs over dihedral groups: A complete and practical characterization

This paper characterize the conjugation-closed connection sets of connected Cayley graphs over dihedral groups that admit perfect state transfer by applying Ramanujan sums, Mobius inversion, and arguments based on the rational numbers that yields a complete and practical characterization of these connection sets.

Shi-Xin Wang · 0 citations
Preprint Jul 2026

The Aldous property for normal Cayley graphs on symmetric groups

Aldous'spectral gap conjecture states that the random walk and the interchange process on any connected graph have the same spectral gap, or, equivalently, the second largest eigenvalue of any connected Cayley graph on the symmetric group $S_n$ with respect to a set of transpositions is achieved by the standard represe...

Chen-Hui Lv, Sanming Zhou · 0 citations
Preprint Aug 2026

Ramanujan Cayley Graphs with Normal Connection Sets in Ratio-One Frobenius Groups

Let $G=N\rtimes H$ be a finite Frobenius group with $|N|=q$ and $|H|=q-1$. We classify all Ramanujan Cayley graphs of $G$ whose connection sets are normal, in the sense of being unions of conjugacy classes. The group-theoretic input is a simple blow-up phenomenon: every such Cayley graph is either $Y[\overline{K_q}]$ o...

Ming-Hsuan Kang, Chi-Jung Yang · 0 citations
Preprint Aug 2026

The Cayley Completion of a Graph

A finite connected graph is rarely a Cayley graph. We measure how far it is from being one: given $G$ with $n$ vertices and $m$ edges, how few edges must be added, or added and deleted, before the result is a Cayley graph of an abelian group of order $n$ on the same vertex set? This defines two invariants, the completi...

Rigobert Fokam Souop, Laurent Bitjoka · 2 citations · ⚡2
Preprint Sep 2026

Induced Embeddings of Graphs into Abelian Cayley Graphs

For a finite graph $G$ on $n$ vertices, let $\eta(G)$ denote the least order of a finite abelian group $\Gamma$ for which $G$ is an induced subgraph of some Cayley graph of $\Gamma$. Babai and S\'os (1985) settled the worst-case order of magnitude: it is $\Theta(n^2)$. We treat $\eta$ instead as an invariant of the ind...

Rigobert Fokam Souop, Laurent Bitjoka · 0 citations
Preprint Aug 2026

Perfect State Transfer on Oriented Circulant Graphs: A Complete Classification

The continuous-time quantum walk on an oriented circulant graph is determined by the Fourier eigenvalues of its Hermitian adjacency matrix. We classify perfect state transfer (PST) between distinct vertices in every nonempty oriented circulant graph. We show that each such graph is described by an odd primitive quadrat...

Xingwu Song · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.