Strongly regular and strongly walk-regular graphs that admit perfect state transfer

Abstract

We study perfect state transfer in Grover walks on two important classes of graphs: strongly regular graphs and strongly walk-regular graphs. The latter class is a generalization of the former. We first give a complete classification of strongly regular graphs that admit perfect state transfer. The only such graphs are the complete bipartite graph $K_{2,2}$ and the complete tripartite graph $K_{2,2,2}$. We then show that, if a connected strongly walk-regular graph that is not a strongly regular graph admits perfect state transfer, then its spectrum must be of the form $\{[k]^1, [\frac{k}{2}]^α, [0]^β, [-\frac{k}{2}]^γ\}$, and we enumerate all feasible spectra of this form up to $k=20$ with the help of a computer. These results are obtained using techniques from algebraic number theory and spectral graph theory, particularly through the analysis of eigenvalues and eigenprojections of a normalized adjacency matrix. While the setting is in quantum walks, the core discussion is developed entirely within the framework of spectral graph theory.

Figures (1)

• Figure 1: Logical relationships between periodicity and perfect state transfer

Theorems & Definitions (49)

• Theorem 1.1
• Theorem 1.2
• Lemma 2.1: BH
• Lemma 2.2
• Definition 2.3
• Theorem 2.4: KY
• Lemma 2.5
• proof
• Lemma 2.6: J
• Lemma 2.7: J