Management Applications of Perfect State Transfer in graphs

Management Applications of Perfect State Transfer in graphs

Mohammadesmail Nikfar1

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

IOI Code : ADCZ-ACAFZC
Publication : 16th International Conference on Interdisciplinary Research in Civil Engineering, Architecture and Urban Management in the 21st Century(caum.ir/16th)
Abstract :
    It has been proven that perfect state transfer between the end vertices of a path graph on $n$ vertices cannot occur if $n \ge 4$. Furthermore, it can be shown that $P_2$ and $P_3$ are the only path graphs that admit perfect state transfer. This result was established as part of a collaborative project. To begin, we recall some basic properties of path graphs. First, the characteristic polynomial $P_n(x)$ satisfies the recurrence relation $P_n(x) = x P_{n-1}(x) - P_{n-2}(x)$. A consequence of this is that $P_n(x)$ and $P_{n-1}(x)$ are coprime. Since interpolation implies that any multiple of an eigenvalue of $P_{n-1}$ must also be an eigenvalue of $P_n$, it follows that the eigenvalues ​​of a path graph are simple. Given that $P_n(x)$ and $P_{n-1}(x)$ are coprime, it follows that perfect state transfer between the end vertices of $P_n$ cannot occur for $n \ge 4$. By utilizing the indicator—and indeed the identity—$P(x, \phi) \cdot P_3(x, \phi) = P_3(x, \phi)$ (which is readily derived via induction for the aforementioned recurrence equation), it is straightforward to demonstrate that $P(x, \phi)$ and $P_3(x, \phi)$ share a non-trivial common factor if and only if $m+1$ divides $n+1$. This rule provides a wide—and indeed, even broader—range of possibilities for the case of complete commutativity.

Keywords : regular graph perfect state transfer continuous time quantum walk