Universal scaling hypothesis of quantum spatial search in complex networks

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 (15)

• The Quantum Internet
• Finding community structure in networks using the eigenvectors of matrices
• Cooperative Game Theory Approaches for Network Partitioning
• Cascade control and defense in complex networks
• Spatial search by quantum walk
• Quantum Walk in Position Space with Single Optically Trapped Atoms
• Towards a global quantum network
• Complex networks renormalization: flows and fixed points
• Return times of random walk on generalized random graphs
• Transport properties of continuous-time quantum walks on Sierpinski fractals
• Discrete-time quantum walk on complex networks for community detection
• Search on a Hypercubic Lattice through a Quantum Random Walk: II. d=2
• Continuous-time quantum walk spatial search on the Bollobás scale-free network
• Quantum walks on complex networks with connection instabilities and community structure
• Null-eigenvalue localization of quantum walks on real-world complex networks