State Transfer For Graphs

Mohammadesmail Nikfar1

1) Associate Professor, Ph.D. in Mathematics, Department of Mathematics, School of Hekmat 1, District 4, Tehran, Iran.

IOI Code : ACGH-ACAEKC
Publication : The 1st National Conference of Expert Teachers(confn.ir/1st)
Abstract :
    Suppose $X$ is a graph with adjacency matrix $A$; we then define $H(t)$ as the operator $\exp(itA)$. A state transfer from vertex $u$ to vertex $v$ in $X$ occurs at time $t$ if the $(u, v)$-entry of $H(t)$ satisfies $|(H(t))_{uv}| = 1$. State transfer is utilized in key distribution within commercial cryptographic systems and appears to have other potential applications as well. It is recommended to compile a list of existing research on perfect state transfer, along with the associated open questions. In this paper, the focus is entirely on the mathematics.

Keywords : regular graph perfect state transfer continuous time quantum walk