Perfect state transfer on distance-regular graphs and association schemes
Abstract
We consider the representation of a continuous-time quantum walk in a graph X by the matrix (itA(X)). We provide necessary and sufficient criteria for distance-regular graphs and, more generally, for graphs in association schemes to have perfect state transfer. Using these conditions, we provide several new examples of perfect state transfer in simple graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.