2025/06/09 by Koushik Bhakta, Bikash Bhattacharjya, Bhakta, Koushik +1 · 1 citation
Computer Science · Mathematics · #05C50 #05E30 #81Q99 #Algebraic structures and combinatorial models #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2506.07439
openalex publication_date 2025/06/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper investigates perfect state transfer in Grover walks, a model of discrete-time quantum walks. We establish a necessary and sufficient condition for the occurrence of perfect state transfer on graphs belonging to an association scheme. Our focus includes specific association schemes, namely the Hamming and Johnson schemes. We characterize all graphs on the classes of Hamming and Johnson schemes that exhibit perfect state transfer. Furthermore, we study perfect state transfer on distance-regular graphs. We provide complete characterizations for exhibiting perfect state transfer on distance-regular graphs of diameter 2 and diameter 3, as well as integral distance-regular graphs.