Perfect state transfer on gcd-graphs over a finite Frobenius ring

The existence of perfect state transfer (PST) on quantum spin networks is a fundamental problem in mathematics and physics.

Various works in the literature have explored PST in graphs with arithmetic origins, such as gcd-graphs over $\mathbb{Z}$ and cubelike graphs.

In this article, building on our recent work on gcd-graphs over an arbitrary finite Frobenius ring, we investigate the existence of PST on these graphs.

Our approach is algebraic in nature, enabling us to unify various existing results in the literature.