Optimized quantum random-walk search algorithms on the hypercube

V. Potoček, A. Gábris, T. Kiss, I. Jex

Research output: Contribution to journalArticle

69 Citations (Scopus)


Shenvi, Kempe, and Whaleya's quantum random-walk search (SKW) algorithm is known to require O (N) number of oracle queries to find the marked element, where N is the size of the search space. The overall time complexity of the SKW algorithm differs from the best achievable on a quantum computer only by a constant factor. We present improvements to the SKW algorithm which yield a significant increase in success probability, and an improvement on query complexity such that the theoretical limit of a search algorithm succeeding with probability close to one is reached. We point out which improvement can be applied if there is more than one marked element to find.

Original languageEnglish
Article number012325
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Issue number1
Publication statusPublished - Jan 5 2009

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Fingerprint Dive into the research topics of 'Optimized quantum random-walk search algorithms on the hypercube'. Together they form a unique fingerprint.

  • Cite this