The perfect state transfer and the success probability of finding the marked vertex on the N -fold star power graph G ⋆ N
Qi Han, Rong Zhang, Jingyi Zhang +2 more
Abstract In this paper, within the framework of continuous-time quantum walks (CTQWs), we decompose graphs into disjoint strata by adopting the idea of equitable partitions. Based on the thought, we investigate the success probability of finding marked vertices on the N -fold star power graph G ⋆ N (where G is a cycle graph with three vertices), as well as the time required for perfect state transfer. Additionally, we explore the time for perfect state transfer on G ⋆ N under partition conditions from the perspective of quantum probability. Specifically, we surprisingly discover an interesting result: the times for perfect state transfer under quantum probability-based partitions and equitable partitions are completely consistent when the coupling strength J = 1 and the parameter λ = 1.
Physica Scripta•Dec 1, 2025•0 citations