Randomized trial investigates perfect state transfer in gcd-graphs, suggesting significant mathematical implications.
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 [Formula: see text] 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.
No takes yet. Share an insight, caveat, or question.
Nguyen et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: