Quantum-walk-based search and centrality

Scott D. Berry, Jingbo B. Wang

Research output: Contribution to journalArticlepeer-review

44 Citations (Scopus)


We study the discrete-time quantum-walk-based search for a marked vertex on a graph. By considering various structures in which not all vertices are equivalent, we investigate the relationship between the successful search probability and the position of the marked vertex, in particular, its centrality. We find that the maximum value of the search probability does not necessarily increase as the marked vertex becomes more central, and we investigate an interesting relationship between the frequency of the successful search probability and the centrality of the marked vertex.

Original languageEnglish
Article number042333
Pages (from-to)1-12
Number of pages12
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Issue number4
Publication statusPublished - 26 Oct 2010
Externally publishedYes

Fingerprint Dive into the research topics of 'Quantum-walk-based search and centrality'. Together they form a unique fingerprint.

Cite this