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
K2,2 and the complete tripartite graph
K2,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,[2k]α,[0]β,[−2k]γ}, 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.
Given a graph G, the graph 𝒬(G) is obtained by inserting a new vertex into every edge of G, then connecting those inserted vertices on the neighbouring edges in G. We usually refer to 𝒬(G) as the 𝒬-graph of G. This article mainly focuses on the effects of 𝒬-graph operation on quantum state transfer. It is shown that if G is an integral r-regular graph for r ≥ 2, then 𝒬(G) always avoids perfect state transfer. In contrast, we also show that, this 𝒬-graph exists pretty good state transfer under some special circumstances. Subsequently, by applying the results obtained above, we also display many new classes of 𝒬-graphs that avoid perfect state transfer but exist pretty good state transfer.