Finding Structural Anomalies in Star Graphs Using Quantum Walks: A General Approach
arXiv:1404.5281 · doi:10.1088/1751-8113/48/3/035304
Abstract
In previous papers about searches on star graphs several patterns have been made apparent; the speed up only occurs when graphs are "tuned" so that their time step operators have degenerate eigenvalues, and only certain initial states are effective. More than that, the searches are never faster than order root N time. In this paper the problem is defined rigorously, the causes for all of these patterns are identified, sufficient and necessary conditions for quadratic-speed searches for any connected subgraph are demonstrated, the tolerance of these conditions is investigated, and it is shown that (unfortunately) we can do no better than order root N time. Along the way, a useful formalism is established that may be useful in future work involving highly symmetric graphs.
57 pages, 3 figures
References in corpus (17)
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- Quantum walks of correlated particles
- Spatial search by quantum walk
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Photons Walking the Line: A quantum walk with adjustable coin operations
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Quantum walk of a trapped ion in phase space
- A 2D Quantum Walk Simulation of Two-Particle Dynamics
- Optimized quantum random-walk search algorithms
- Quantum walks based on an interferometric analogy
- Quantum walks on quotient graphs
- Quantum Walks
- Searching via walking: How to find a marked subgraph of a graph using quantum walks
- Finding structural anomalies in graphs by means of quantum walks
- Quantum walks as a probe of structural anomalies in graphs
- Finding structural anomalies in star graphs: A general approach