Engineering the success of quantum walk search using weighted graphs

Thomas G. Wong, Pascal Philipp

Research output: Contribution to journalArticlepeer-review

6 Scopus citations


Continuous-time quantum walks are natural tools for spatial search, where one searches for a marked vertex in a graph. Sometimes the structure of the graph causes the walker to get trapped, such that the probability of finding the marked vertex is limited. We give an example with two linked cliques, proving that the captive probability can be liberated by increasing the weights of the links. This allows the search to succeed with probability 1 without increasing the energy scaling of the algorithm. Further increasing the weights, however, slows the runtime, so the optimal search requires weights that are neither too weak nor too strong.

Original languageEnglish (US)
Article number022304
JournalPhysical Review A
Issue number2
StatePublished - Aug 4 2016
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Atomic and Molecular Physics, and Optics


Dive into the research topics of 'Engineering the success of quantum walk search using weighted graphs'. Together they form a unique fingerprint.

Cite this