Universal scaling hypothesis of quantum spatial search in complex networks
AI Breakdown
Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.
Abstract
Since quantum spatial searches on networks have a strong network dependence, the question arises whether the universal perspective exists in this quantum algorithm for various networks. Here, we propose a universal scaling hypothesis 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. Published by the American Physical Society 2024