When can perfect state transfer occur?

From MaRDI portal



Abstract: Let X be a graph on n vertices with with adjacency matrix A and let H(t) denote the matrix-valued function exp(iAt). If u and v are distinct vertices in X, we say perfect state transfer from u to v occurs if there is a time au such that |H(au)u,v|=1. Our chief problem is to characterize the cases where perfect state transfer occurs. We show that if perfect state transfer does occur in a graph, then the spectral radius is an integer or a quadratic irrational; using this we prove that there are only finitely many graphs with perfect state transfer and with maximum valency at most 4K4. We also show that if perfect state transfer from u to v occurs, then the graphs Xsetminusu and Xsetminusv are cospectral and any automorphism of X that fixes u must fix v (and conversely).





Cited in
(94)








This page was built for publication: When can perfect state transfer occur?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166912)