Spatial search by continuous-time quantum walks on renormalized Internet networks
arXiv:2205.02137 · doi:10.1103/PhysRevResearch.4.043185
Abstract
We study spatial search with continuous-time quantum walks on real-world complex networks. We use smaller replicas of the Internet network obtained with a recent geometric renormalization method introduced by García-Pérez et al., Nat. Phys. 14, 583 (2018). This allows us to infer for the first time the behavior of a quantum spatial search algorithm on a real-world complex network. By simulating numerically the dynamics and optimizing the coupling parameter, we study the optimality of the algorithm and its scaling with the size of the network, showing that on average it is considerably better than the classical scaling , but it does not reach the ideal quadratic speedup that can be achieved, e.g. in complete graphs. However, the performance of the search algorithm strongly depends on the degree of the nodes and, in fact, the scaling is found to be very close to optimal when we consider the nodes below the th percentile ordered according to the degree.
arXiv comment11 pages, 6 figures
References in corpus (31)
- Statistical mechanics of complex networks
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Hyperbolic Geometry of Complex Networks
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Spatial search by quantum walk
- Sustaining the Internet with Hyperbolic Mapping
- Self-similarity of complex networks and hidden metric spaces
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Experimental Two-dimensional Quantum Walk on a Photonic Chip
- Network Geometry
- Spatial search by quantum walk is optimal for almost all graphs
- Quantum walks of correlated photon pairs in two-dimensional waveguide arrays
- Complex Networks from Classical to Quantum
- Multiscale unfolding of real networks by geometric renormalization
- Quantum walk approach to search on fractal structures
- Global Symmetry is Unnecessary for Fast Quantum Search
- Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
- Connectivity is a Poor Indicator of Fast Quantum Search
- Quadratic speedup for spatial search by continuous-time quantum walk
- On the optimality of spatial search by continuous-time quantum walk
- Community Detection in Quantum Complex Networks
- Spatial Search by Continuous-Time Quantum Walk with Multiple Marked Vertices
- Quantum spatial search on graphs subject to dynamical noise
- Continuous-time quantum walks on dynamical percolation graphs
- Continuous-time quantum walk spatial search on the Bollobás scale-free network
- Stochastic collision model approach to transport phenomena in quantum networks
- Quantum Walk Search on Kronecker Graphs
- Efficient quantum transport in a multi-site system combining classical noise and quantum baths
- Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks