Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices

The continuous-time quantum walk (CTQW) on the strongly regular graph is studied in this paper, and the exact transition probability distribution between any two vertices of the graph is provided by using the method of counting the walks between these two vertices. The CTQW is also considered on the perturbed strongly regular graph (SRG) by adding multiple loops on given vertices. Spatial search using CTQW can be regarded as a special case of CTQW on the perturbed SRG by adding loops. Combined with the approach of walk counting, the proper parameter settings and search time of spatial search for both a single marked vertex and two marked vertices are provided. The results show that both kinds of spatial search can be undertaken in O(N)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\sqrt{N})$$\end{document} time in a degree k SRG with N vertices, by setting jump rate of CTQW to be 1 / k.