Preprint
Jul 2026
Marked vertex search on disordered graphs with Rosenzweig-Porter phases
These results establish a direct and quantitative link between random matrix disorder on graphs and the performance of continuous-time quantum walk search, and suggest that disorder, rather than being merely an obstacle, can be exploited as a tunable parameter in quantum search protocols.
Sabyasachi Chakraborty, T. Čadež, Sonjoy Majumder et al.
· 0 citations