Local subgraph structure can cause localization in continuous-time quantum walk

Yusuke Ide

Published 2014-06-02, updated 2014-07-17Version 2

In this paper, we consider continuous-time quantum walks (CTQWs) on finite graphs determined by the Laplacian matrices. By introducing fully interconnected graph decomposition of given graphs, we show a decomposition method for the Laplacian matrices. Using the decomposition method, we show several conditions for graph structure which return probability of CTQW tends to 1 while the number of vertices tends to infinity.