Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems
DOI10.1088/1751-8121/AC72D5OpenAlexW4281476944MaRDI QIDQ5052049FDOQ5052049
Authors: Luca Razzoli, Paolo Bordone, Matteo G. A. Paris 
Publication date: 18 November 2022
Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.13824
Recommendations
- Walking on vertices and edges by continuous-time quantum walk
- Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices
- Local subgraph structure can cause localization in continuous-time quantum walk
- Laplacian versus adjacency matrix in quantum walk search
- Spatial search by continuous-time quantum walk with multiple marked vertices
Applications of graph theory (05C90) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Quantum field theory on lattices (81T25)
Cites Work
- Title not available (Why is that?)
- Spatial search and the Dirac equation
- Spatial search by continuous-time quantum walk with multiple marked vertices
- Perfect state transfer in Laplacian quantum walk
- Laplacian versus adjacency matrix in quantum walk search
- Investigation of continuous-time quantum walk by using Krylov subspace-Lanczos algorithm
- Exact analytical results for quantum walks on star graphs
- Quantum walks and search algorithms
Cited In (3)
This page was built for publication: Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5052049)
