Local subgraph structure can cause localization in continuous-time quantum walk
arXiv:1406.0347
Abstract
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.
8 pages, Accepted for publication in Yokohama Mathematical Journal
References in corpus (5)
- Coherent exciton transport in dendrimers and continuous-time quantum walks
- Quantum transport on small-world networks: A continuous-time quantum walk approach
- Exact analytical results for quantum walks on star graph
- Spin systems dynamics and faults detection in threshold networks
- Quantum central limit theorem for continuous-time quantum walks on odd graphs in quantum probability theory