Quantum Information Processing

, Volume 15, Issue 4, pp 1411–1443

Spatial search by continuous-time quantum walk with multiple marked vertices


DOI: 10.1007/s11128-015-1239-y

Cite this article as:
Wong, T.G. Quantum Inf Process (2016) 15: 1411. doi:10.1007/s11128-015-1239-y


In the typical spatial search problems solved by continuous-time quantum walk, changing the location of the marked vertices does not alter the search problem. In this paper, we consider search when this is no longer true. In particular, we analytically solve search on the “simplex of \(K_M\) complete graphs” with all configurations of two marked vertices, two configurations of \(M+1\) marked vertices, and two configurations of \(2(M+1)\) marked vertices, showing that the location of the marked vertices can dramatically influence the required jumping rate of the quantum walk, such that using the wrong configuration’s value can cause the search to fail. This sensitivity to the jumping rate is an issue unique to continuous-time quantum walks that does not affect discrete-time ones.


Grover’s algorithm Quantum search Spatial search  Quantum random walk Multiple marked vertices 

Funding information

Funder NameGrant NumberFunding Note
Seventh Framework Programme
  • QALGO (Grant no. 600700)
European Research Council
  • MQC

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.Faculty of ComputingUniversity of LatviaRīgaLatvia

Personalised recommendations