Local subgraph structure can cause localization in continuous-time quantum walk
From MaRDI portal
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.
Recommendations
- Localization of quantum walks on a deterministic recursive tree
- Localization on quantum graphs with random edge lengths
- Localization of an inhomogeneous discrete-time quantum walk on the line
- Localization on quantum graphs with random vertex couplings
- Localization in quantum walks with periodically arranged coin matrices
- Localization in a quasiperiodic model on quantum graphs
- Dynamical localization of quantum walks in random environments
- Dynamical localization for \(d\)-dimensional random quantum walks
- Localization of a multi-dimensional quantum walk with one defect
- LOCALIZATION ON A QUANTUM GRAPH WITH A RANDOM POTENTIAL ON THE EDGES
Cited in
(5)- Continuous-time quantum walks on the threshold network model
- Approximate locality for quantum systems on graphs
- Localization of quantum walks on a deterministic recursive tree
- Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
This page was built for publication: Local subgraph structure can cause localization in continuous-time quantum walk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4982601)
