Pulsation of quantum walk on Johnson graph
Abstract
We propose a phenomenon of discrete-time quantum walks on graphs called the pulsation, which is a generalization of a phenomenon in the quantum searches. This phenomenon is discussed on a composite graph formed by two connected graphs G1 and G2. The pulsation means that the state periodically transfers between G1 and G2 with the initial state of the uniform superposition on G1. In this paper, we focus on the case for the Grover walk where G1 is the Johnson graph and G2 is a star graph. Also, the composite graph is constructed by identifying an arbitrary vertex of the Johnson graph with the internal vertex of the star graph. In that case, we find the pulsation with O(N1+1/k) periodicity, where N is the number of vertices of the Johnson graph. The proof is based on Kato's perturbation theory in finite-dimensional vector spaces.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.