Abstract
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(\sqrt{N})\) time in a degree k SRG with N vertices, by setting jump rate of CTQW to be 1 / k.
Similar content being viewed by others
References
Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58(2), 915–928 (1998)
Kempe, J.: Quantum random walks: an introductory overview. Contemp. Phys. 44(4), 307–327 (2003)
Ambainis, A.: Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 1(04), 507–518 (2003)
Childs, A.M., Farhi, E., Gutmann, S.: An example of the difference between quantum and classical random walks. Quantum Inf. Process. 1(1–2), 35–43 (2002)
Konno, N.: Limit theorem for continuous-time quantum walk on the line. Phys. Rev. E 72(2), 026113 (2005)
Mülken, O., Blumen, A.: Spacetime structures of continuous-time quantum walks. Phys. Rev. E 71(3), 036128 (2005)
Mülken, O., Blumen, A.: Continuous-time quantum walks: Models for coherent transport on complex networks. Phys. Rep. 502(2–3), 37–87 (2011)
Galiceanu, M., Strunz, W.T.: Continuous-time quantum walks on multilayer dendrimer networks. Phys. Rev. E 94(2), 022307 (2016)
Salimi, S.: Continuous-time quantum walks on semi-regular spidernet graphs via quantum probability theory. Quantum Inf. Process. 9(1), 75–91 (2010)
Mülken, O., Pernice, V., Blumen, A.: Quantum transport on small-world networks: a continuous-time quantum walk approach. Phys. Rev. E 76(5), 051125 (2007)
Gamble, J.K., Friesen, M., Zhou, D., Joynt, R., Coppersmith, S.N.: Two-particle quantum walks applied to the graph isomorphism problem. Phys. Rev. A 81(5), 90–90 (2010)
Douglas, B.L., Wang, J.B.: A classical approach to the graph isomorphism problem using quantum walks. J. Phys. A Math. Theor. 41(7), 075303 (2008)
Childs, A.M., Goldstone, J.: Spatial search by quantum walk. Phys. Rev. A 70(2), 022314 (2004)
Childs, A.M., Ge, Y.: Spatial search by continuous-time quantum walks on crystal lattices. Phys. Rev. A 89(5), 052337 (2014)
Meyer, D.A., Wong, T.G.: Connectivity is a poor indicator of fast quantum search. Phys. Rev. Lett. 114(11), 110503 (2015)
Wong, T.G.: Spatial search by continuous-time quantum walk with multiple marked vertices. Quantum Inf. Process. 15(4), 1411–1443 (2016)
Janmark, J., Meyer, D.A., Wong, T.G.: Global symmetry is unnecessary for fast quantum search. Phys. Rev. Lett. 112(21), 210502 (2014)
Smith, J.: k-Boson quantum walks do not distinguish arbitrary graphs. arXiv:1004.0206 (2010)
Godsil, C., Royle, G.F.: Algebraic Graph Theory. Springer, Berlin (2013)
Bapat, R.B.: Graphs and Matrices, vol. 27. Springer, Berlin (2010)
Van Mieghem, P.: Graph Spectra for Complex Networks. Cambridge University Press, Cambridge (2011)
Cvetković, D.M., Doob, M., Sachs, H.: Spectra of Graphs: Theory and Application, vol. 87. Academic Press, Cambridge (1980)
Acknowledgements
This work is supported by the National Natural Science Foundation of China (Grant Nos. 61502101, 61802002), the Natural Science Foundation of Anhui Province, China (Grant No. 1708085MF162), the Natural Science Foundation of Jiangsu Province, China (Grant No. BK20171458) and the Six Talent Peaks Project of Jiangsu Province, China (Grant No. 2015-XXRJ-013).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
The number of walks \(L_s\) from one vertex to a non-adjacent vertex in SRG, we obtain it by using Mathematica, is
where
Rights and permissions
About this article
Cite this article
Li, X., Chen, H., Ruan, Y. et al. Continuous-time quantum walks on strongly regular graphs with loops and its application to spatial search for multiple marked vertices. Quantum Inf Process 18, 195 (2019). https://doi.org/10.1007/s11128-019-2250-5
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-019-2250-5