2025/04/15 by Monterde, Hermie, Hiranmoy Pal, Pal, Hiranmoy +2 · 2 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum many-body systems
paper · pdf · doi:10.48550/arxiv.2504.11585
This paper is a sequel to the work of Bhattacharjya et al. (J. Phys. A-Math. 57.33: 335303, https://doi.org/10.1088/1751-8121/ad6653) on quantum state transfer on blow-up graphs, where instead of the adjacency matrix, we take the Laplacian matrix as the time-independent Hamiltonian associated with a blow-up graph. We characterize strong cospectrality, periodicity, perfect state transfer (LPST) and pretty good state transfer (LPGST) on blow-up graphs. We present several constructions of blow-up graphs with LPST and produce new infinite families of regular graphs where each vertex is involved in LPST. We also determine LPST and LPGST in blow-ups of classes of trees. Finally, if n≡ 0 (mod 4), then the blow-up of n copies of a graph G has no LPST, but we show that under certain conditions, the addition of an appropriate matching this blow-up graph results in LPST.