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 $G_{1}$ and $G_{2}$. The pulsation means that the state periodically transfers between $G_{1}$ and $G_{2}$ with the initial state of the uniform superposition on $G_1$. In this paper, we focus on the case for the Grover walk where $G_{1}$ is the Johnson graph and $G_{2}$ 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(\sqrt{N^{1+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.

Figures (4)

• Figure 1:
• Figure 2:
• Figure 4:
• Figure 5:

Theorems & Definitions (13)

• Theorem 1
• Theorem 2
• Proposition 1
• Proposition 2
• Lemma 1
• proof
• Lemma 2
• Proposition 3
• Lemma 3
• proof