Pulsation of quantum walk on Johnson graph
Taisuke Hosaka, Etsuo Segawa

TL;DR
This paper introduces the pulsation phenomenon in discrete-time quantum walks on graphs, demonstrating periodic state transfer between Johnson and star graphs, with a focus on Grover walks and mathematical proof of periodicity.
Contribution
It generalizes quantum search phenomena by analyzing pulsation in quantum walks on composite Johnson-star graphs using perturbation theory.
Findings
Pulsation occurs with O(√N^{1+1/k}) periodicity.
The phenomenon is demonstrated on Johnson and star graph composites.
Mathematical proof based on Kato's perturbation theory.
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 and . The pulsation means that the state periodically transfers between and with the initial state of the uniform superposition on . In this paper, we focus on the case for the Grover walk where is the Johnson graph and 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 periodicity, where is the number of vertices of the Johnson graph. The proof is based on Kato's perturbation theory in finite-dimensional vector spaces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
