Diagrammatic Approach to Quantum Search
arXiv:1410.7201 · doi:10.1007/s11128-015-0959-3
Abstract
We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate perturbation theory's effects on them. Using this method, we give the first example of degenerate perturbation theory solving search on a graph whose evolution occurs in a subspace whose dimension grows with .
9 pages, 7 figures
References in corpus (5)
Cited by in corpus (15)
- Grover Search with Lackadaisical Quantum Walks
- Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
- Laplacian versus Adjacency Matrix in Quantum Walk Search
- Spatial Search by Continuous-Time Quantum Walk with Multiple Marked Vertices
- Quantum Search with Multiple Walk Steps per Oracle Query
- Quantum Walk Search on Johnson Graphs
- Faster Quantum Walk Search on a Weighted Graph
- Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk
- Transport efficiency of continuous-time quantum walks on graphs
- Quantum Walk Search on Kronecker Graphs
- Engineering the Success of Quantum Walk Search Using Weighted Graphs
- Doubling the Success of Quantum Walk Search Using Internal-State Measurements
- Impact of global and local interaction on quantum spatial search on chimera graph
- Dimerized Decomposition of Quantum Evolution on an Arbitrary Graph
- Initialization Errors in Quantum Data Base Recall