Universal scaling hypothesis of quantum spatial search in complex networks
arXiv:2401.11922 · doi:10.1103/PhysRevResearch.6.043119
Abstract
Since quantum spatial searches on complex networks have a strong network dependence, the question arises whether the universal perspective exists in this quantum algorithm for complex networks. Here, we uncover the universal scaling laws of the quantum spatial search on complex networks such as small-world and scale-free networks. The average path length, a key quantity in the complex network science, is useful to expose this universal feature, where the collapse plot can be generated for the optimal time, the maximal finding probability and the optimal hopping parameter. Based on the path integral method, we also clarify that the probability amplitude in the continuous-time quantum walk can be determined by the path length distribution. Our results demonstrate a new link between the quantum physics and the complex networks.
References in corpus (64)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- The Quantum Internet
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Random graphs with arbitrary degree distributions and their applications
- Self-similarity of complex networks
- Renormalization group analysis of the small-world network model
- Universal Behavior of Load Distribution in Scale-free Networks
- Scaling and percolation in the small-world network model
- Search in Power-Law Networks
- A Quantum Random Walk Search Algorithm
- Bose-Einstein condensation in complex networks
- Cascade control and defense in complex networks
- Spatial search by quantum walk
- Social Structure of Facebook Networks
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Photons Walking the Line: A quantum walk with adjustable coin operations
- Detecting fuzzy community structures in complex networks with a Potts model
- Realization of a quantum walk with one and two trapped ions
- An example of the difference between quantum and classical random walks
- Towards a global quantum network
- Comparing Community Structure to Characteristics in Online Collegiate Social Networks
- Distributed quantum sensing in a continuous variable entangled network
- Entanglement Percolation in Quantum Networks
- Skeleton and fractal scaling in complex networks
- Diffusion, localization and dispersion relations on ``small-world'' lattices
- Spatial search by quantum walk is optimal for almost all graphs
- Quantum complex networks
- Complex Networks from Classical to Quantum
- Quantum stochastic walks: A generalization of classical random walks and quantum walks
- Quantum Navigation and Ranking in Complex Networks
- Quantum network routing and local complementation
- Entanglement percolation in quantum complex networks
- Quantum walk approach to search on fractal structures
- Universality in Complex Networks: Random Matrix Analysis
- Detecting Multiple Communities Using Quantum Annealing on the D-Wave System
- Self-similar Scale-free Networks and Disassortativity
- Complex networks renormalization: flows and fixed points
- Spectral dimensions of hierarchical scale-free networks with shortcuts
- Statistical properties of the quantum internet
- Quantifying Complexity in Quantum Phase Transitions via Mutual Information Complex Networks
- Quantum sensing networks for the estimation of linear functions
- Return times of random walk on generalized random graphs
- Simulating complex quantum networks with time crystals
- Degree Distribution in Quantum Walks on Complex Networks
- Transport properties of continuous-time quantum walks on Sierpinski fractals
- Higher winding number in a non-unitary photonic quantum walk
- Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2
- Discrete-time quantum walk on complex networks for community detection
- Community Detection in Quantum Complex Networks
- Search on a Fractal Lattice using a Quantum Random Walk
- Search on a Hypercubic Lattice through a Quantum Random Walk: II. d=2
- Traversal Times for Random Walks on Small-World Networks
- Continuous-time quantum walk spatial search on the Bollobás scale-free network
- Quantum walks on complex networks with connection instabilities and community structure
- Quantum centrality testing on directed graphs via PT-symmetric quantum walks
- Vertices cannot be hidden from quantum spatial search for almost all random graphs
- Weighted Laplacian and Its Theoretical Applications
- Scaling Hypothesis of Spatial Search on Fractal Lattice Using Quantum Walk
- Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks
- Null-eigenvalue localization of quantum walks on real-world complex networks
- Spatial Search on Sierpinski Carpet Using Quantum Walk