Faster quantum walk search on a weighted graph

Research output: Contribution to journalArticlepeer-review

17 Scopus citations


A randomly walking quantum particle evolving by Schrödinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time Θ(N3/4). We give a weighted version of this graph that preserves vertex transitivity, and we show that the time to search on it can be reduced to nearly Θ(N). To prove this, we introduce two extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges and a method to determine how precisely the jumping rate of the quantum walk must be chosen.

Original languageEnglish (US)
Article number032320
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Issue number3
StatePublished - Sep 21 2015
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Atomic and Molecular Physics, and Optics


Dive into the research topics of 'Faster quantum walk search on a weighted graph'. Together they form a unique fingerprint.

Cite this