Pulsation of quantum walk between two arbitrary graphs with weakly connected bridge

TL;DR

This paper studies the pulsation phenomenon in quantum walks on two connected graphs, showing how the walker periodically transfers between them depending on the connection strength and graph sizes.

Contribution

It provides an asymptotic expression for the quantum walk probability and characterizes the pulsation behavior based on graph edge counts.

Findings

Quantum walker exhibits periodic pulsation between graphs for small connectivity.

Transfer period scales as O(ε^{-1/2}) with connection strength.

Complete transfer occurs when graphs have equal number of edges.

Abstract

We consider the Grover walk on a finite graph composed of two arbitrary simple graphs connected by one edge, referred to as a bridge. The parameter $\epsilon>0$ assigned at the bridge represents the strength of connectivity: if $\epsilon=0$, then the graph is completely separated. We show that for sufficiently small values of $\epsilon$, a phenomenon called pulsation occurs. The pulsation is characterized by the periodic transfer of the quantum walker between the two graphs. An asymptotic expression with respect to small $\epsilon$ for the probability of finding the walker on either of the two graphs is derived. This expression reveals that the pulsation depends solely on the number of edges in each graph, regardless of their structure. In addition, we obtain that the quantum walker is transferred periodically between the two graphs, with a period of order $O(\epsilon^{-1/2})$. Furthermore, when the number of edges of two graphs is equal, the quantum walker is almost completely transferred.