Perfect and multiple state transfer in oriented Cayley graphs

We study perfect state transfer and multiple state transfer in oriented normal Cayley graphs. We construct examples in a variety of groups, ranging from abelian to nonsolvable, and establish some general restrictions and nonexistence results.

💡 Research Summary

The paper investigates perfect state transfer (PST) and multiple state transfer (MST) in oriented normal Cayley graphs, a class of directed graphs whose adjacency matrices belong to the Bose‑Mesner algebra of a group association scheme. Starting from the definition of an oriented graph (no loops, no multiple edges) and its adjacency matrix Aₓ (entries 1, –1, or 0 depending on the direction of an arc), the authors recall that the quantum walk on such a graph is given by Uₓ(t)=e^{tAₓ}. PST from vertex a to vertex b at time τ means Uₓ(τ)·a=λb with |λ|=1; because Uₓ(τ) is real, λ=±1. The set Sₐ of all vertices reachable from a by PST is introduced, and when |Sₐ|≥3 the graph is said to exhibit multiple state transfer.

A key structural result (Theorem 2.2) shows that if the adjacency matrix lies in a Bose‑Mesner algebra, then any PST induces a fixed‑point‑free permutation matrix U(τ) that cyclically permutes the vertices of Sₐ. Consequently the order of this permutation equals |Sₐ|, and a spectral argument forces |Sₐ| to belong to the set {2, 3, 4, 6} (Corollary 2.3). Moreover, when |Sₐ|=3 or 6 the transfer time τ must be a rational multiple of π√3, while for |Sₐ|=4 it must be a rational multiple of π.

The authors then specialize to normal Cayley digraphs Cay(G, C) where the connection set C is a union of conjugacy classes and C∩C^{-1}=∅, guaranteeing orientation. The adjacency matrix can be written as A=A_C−A_{C^{-1}}. Using the standard decomposition of the group algebra into central idempotents E_χ (χ ranging over irreducible characters of G), the spectrum of A is given by θ_χ=χ(C)−χ(C^{-1})·χ(e). Hence U(t)=∑_χ e^{tθ_χ}E_χ.

Theorem 3.3 provides a complete character‑theoretic criterion for PST from the identity e to a central element z: (1) z must lie in the centre Z(G); (2) for every irreducible character χ, the equality χ(z)·χ(e)=exp(τθ_χ) must hold. This condition forces the order of z to be 2, 3, 4, or 6, and in the cases 3 and 6 the field generated by the character values must contain i√3. From this, Corollary 3.4 shows that once PST occurs from e to z, it automatically yields MST on the cyclic subgroup ⟨z⟩.

Two non‑existence results are derived. First (Corollary 3.5), if a subset Y of irreducible characters satisfies (i) z lies in the kernel of every χ∈Y and (ii) the field Q(χ) generated by each χ equals ℚ, then no normal Cayley graph on G can have PST (hence no MST) on ⟨z⟩. Second (Theorem 4.1), using the theory of p‑special characters, the authors prove that for solvable groups the case |Sₑ|=6 cannot occur; thus for solvable groups |Sₑ|∈{2, 3, 4} only.

The remainder of the paper is devoted to explicit constructions across a wide spectrum of groups:

• Abelian groups Z_{3^n} and Z_{4^n}: PST examples are built for orders 2, 3, 4, while it is shown that MST of size 4 cannot arise in these settings.
• Extra‑special 3‑groups (non‑abelian groups of order 3^{1+2k} with exponent 3): MST on three vertices is realized by selecting a central element of order 3.
• Modular maximal cyclic 2‑groups: MST on four vertices is constructed using a central element of order 4.
• Non‑solvable groups (e.g., A₅, PSL(2, 7), and other simple groups): PST and MST examples for orders 2, 3, 4 are exhibited, illustrating that the restriction |Sₑ|=6 remains open only for non‑solvable groups.
• Wreath product construction (Theorem 9.1): If a normal Cayley graph on G admits PST, then the wreath product G≀S_n also admits PST. This yields an infinite family of non‑abelian, often non‑solvable, examples, including MST of size 4.

Overall, the paper establishes a tight algebraic framework linking quantum state transfer phenomena to group representation theory. The main contributions are: (i) the universal bound |Sₑ|∈{2, 3, 4, 6} and the elimination of the 6‑case for solvable groups; (ii) a character‑based necessary and sufficient condition for PST; (iii) a practical non‑existence criterion based on character fields; and (iv) a rich catalogue of concrete PST/MST graphs across abelian, nilpotent, solvable, and non‑solvable groups, together with a wreath‑product amplification method. These results deepen the understanding of how algebraic symmetry governs quantum information propagation on directed networks and open avenues for designing directed quantum communication architectures with prescribed transfer properties.