More graphs with pair state transfer

Abstract:This paper has two main goals. First, we characterize perfect state transfer between $s$-pair states in strongly regular graphs, as well as graphs in association schemes admitting perfect state transfer between vertices. The second goal is to provide a unified approach for constructing non-regular graphs admitting pair state transfer$-$relative to the adjacency, Laplacian, and signless Laplacian matrix$-$between the same pair of states at the same time. In particular, we show that for each $k\geq 5$, there are infinitely many connected graphs with maximum valency $k$ admitting this property. We also utilize graph products to generate new infinite families of graphs with pair state transfer.

Combinatorics (math.CO); Quantum Physics (quant-ph)

arXiv:2505.07982 [math.CO]

(or arXiv:2505.07982v4 [math.CO] for this version)

https://doi.org/10.48550/arXiv.2505.07982 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.