Perfect state transfer in graphs related to linear groups in two dimensions

From MaRDI portal





This paper constructs 4 families of graphs that admit perfect state transfer.\N\NQuantum states on a graph can evolve over time through continuous-time quantum walks. If an initial state concentrated on one vertex of the graph (i.e., a unit vector whose entry on that vertex is 1) can evolve through this process to a state concentrated on a different vertex, then we say that the graph admits perfect state transfer. There has been a great deal of recent research related to this question, including an important result by \textit{C. Godsil} [Discrete Math. 312, No. 1, 129--147 (2012; Zbl 1232.05123)] showing that perfect state transfer is rare, in the sense that for a given maximal degree, only finitely many connected graphs admit perfect state transfer. Of course, the disjoint union of multiple copies of a graph that admits perfect state transfer also admits perfect state transfer, as does the complement of any graph that admits perfect state transfer, so since \(K_2\) admits perfect state transfer, so does the complement of any number of disjoint copies of \(K_2\).\N\NIn this paper, 4 families of connected graphs admitting perfect state transfer are constructed, none of which is the complement of disjoint copies of \(K_2\). Furthermore, these families involve significant symmetry: three of the families are normal Cayley graphs (in the sense that their connection sets are closed under conjugation) on \(\mathrm{GL}(2,q)\), \(\mathrm{GU}(2,q)\), and \(\mathrm{SL}(2,q)\) respectively. The other is also related to \(\mathrm{GL}(2,q)\) and involves an orbital association scheme, but is not a Cayley graph.











This page was built for publication: Perfect state transfer in graphs related to linear groups in two dimensions

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