Quantum walks as a probe of structural anomalies in graphs
arXiv:1206.6298 · doi:10.1103/PhysRevA.85.062325
Abstract
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external vertices, are connected by edges. In the basic star graph, these are the only edges. If we now connect a subset of the external vertices to form a complete subgraph, a quantum walk can be used to find these vertices with a quantum speedup. Thus, under some circumstances, a quantum walk can be used to locate where the connectivity of a network changes. We also look at the case of two stars connected at one of their external vertices. A quantum walk can find the vertex shared by both graphs, again with a quantum speedup. This provides an example of using a quantum walk in order to find where two networks are connected. Finally, we use a quantum walk on a complete bipartite graph to find an extra edge that destroys the bipartite nature of the graph.
10 pages, 2 figures
References in corpus (13)
- 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
- A 2D Quantum Walk Simulation of Two-Particle Dynamics
- Decoherence in quantum walks - a review
- Optimized quantum random-walk search algorithms
- Quantum walks on quotient graphs
- Quantum searches on highly symmetric graphs
- Finding structural anomalies in graphs by means of quantum walks
- Equivalence between discrete quantum walk models in arbitrary topologies
- Searches on star graphs and equivalent oracle problems
Cited by in corpus (16)
- Perfect state transfer by means of discrete-time quantum walk search algorithms on highly symmetric graphs
- 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
- Finding structural anomalies in star graphs: A general approach
- Finding paths in tree graphs with a quantum walk
- Finding paths with quantum walks or quantum walking through a maze
- Percolation assisted excitation transport in discrete-time quantum walks
- Unveiling and exemplifying the unitary equivalence of discrete time quantum walk models
- Quantum walk based state transfer algorithms on the complete M-partite graph
- Finding Structural Anomalies in Star Graphs Using Quantum Walks: A General Approach
- The walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks
- Suitable bases for quantum walks with Wigner coins
- Scattering Quantum Random Walks on Square Grids and Randomly Generated Mazes
- Analytical expression for variance of homogeneous-position quantum walk with decoherent position
- Persistence of unvisited sites in quantum walks on a line
- Experimental nonlocality-based network diagnostics of mutipartite entangled states