Continuous-time quantum walk spatial search on the Bollob\'as scale-free network
Tomo Osada, Bruno Coutinho, Yasser Omar, Kaoru Sanaka, William J., Munro, Kae Nemoto

TL;DR
This paper investigates how the scale-free structure of networks influences the efficiency of continuous-time quantum walk-based spatial search, revealing the importance of global network properties like closeness centrality over local features.
Contribution
It demonstrates that the global structure, especially closeness centrality, determines search time, and highlights the role of hub nodes in the quantum spatial search on scale-free networks.
Findings
Search time correlates strongly with closeness centrality.
Marked nodes near the hub have significantly shorter search times.
Distribution of search times follows a multi-mode lognormal pattern.
Abstract
The scale-free property emerges in various real-world networks and is an essential property which characterizes the dynamics or features of such networks. In this work we investigate the effect of this scale-free property on a quantum information processing task of finding a marked node in the network, known as the quantum spatial search. We analyze the quantum spatial search algorithm using continuous-time quantum walk on the Bollob\'{a}s network, and evaluate the time to localize the quantum walker on the marked node starting from an unbiased initial state. Our main finding is that is determined by the global structure around the marked node, while some local information of the marked node such as degree does not identify . We discuss this by examining the correlation between and some centrality measures of the network, and show that the closeness centrality of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
