Finding structural anomalies in star graphs: A general approach
arXiv:1310.3147 · doi:10.1103/PhysRevLett.112.030501
Abstract
We develop a general theory for a quantum-walk search on a star graph. A star graph has N edges each of which is attached to a central vertex. A graph G is attached to one of these edges, and we would like to find out to which edge it is attached. This is done by means of a quantum walk, a quantum version of a random walk. This walk contains O(\sqrt{N}) steps, which represents a speedup over a classical search, which would require O(N) steps. The overall graph, star plus G, is divided into two parts, and we find that for a quantum speedup to occur, the eigenvalues associated with these two parts in the N goes to infinity limit must be the same. Our theory tells us how the initial state of the walk should be chosen, and how many steps the walk must make in order to find G.
arXiv commentReplaced with published version
References in corpus (17)
- Strengths and Weaknesses of Quantum Computing
- A Quantum Random Walk Search Algorithm
- Quantum walks of correlated particles
- Tight bounds on quantum searching
- 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 searches on highly symmetric graphs
- Quantum Walks
- Finding structural anomalies in graphs by means of quantum walks
- Quantum walks as a probe of structural anomalies in graphs
- Searches on star graphs and equivalent oracle problems
Cited by in corpus (14)
- Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs
- Limit distributions of three-state quantum walks: the role of coin eigenstates
- Driven Quantum Walks
- Universal measurement-based quantum computation in two-dimensional SPT phases
- Continuous-time quantum walks on dynamical percolation graphs
- Finding paths in tree graphs with a quantum walk
- Robust Quantum Walk Search Without Knowing the Number of Marked Vertices
- Finding paths with quantum walks or quantum walking through a maze
- Percolation assisted excitation transport in discrete-time quantum walks
- Finding Structural Anomalies in Star Graphs Using Quantum Walks: A General Approach
- Suitable bases for quantum walks with Wigner coins
- Scattering Quantum Random Walks on Square Grids and Randomly Generated Mazes
- Experimental nonlocality-based network diagnostics of mutipartite entangled states
- Persistence of unvisited sites in quantum walks on a line