Quantum random-walk search algorithm

Neil Shenvi, Julia Kempe, K. Birgitta Whaley

Research output: Contribution to journalArticle

Abstract

Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with [Formula Presented] calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.

Original languageEnglish (US)
Number of pages1
JournalPhysical Review A - Atomic, Molecular, and Optical Physics
Volume67
Issue number5
DOIs
StatePublished - Jan 1 2003

Fingerprint

random walk
flexibility
formulations

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Quantum random-walk search algorithm. / Shenvi, Neil; Kempe, Julia; Whaley, K. Birgitta.

In: Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 67, No. 5, 01.01.2003.

Research output: Contribution to journalArticle

Shenvi, Neil ; Kempe, Julia ; Whaley, K. Birgitta. / Quantum random-walk search algorithm. In: Physical Review A - Atomic, Molecular, and Optical Physics. 2003 ; Vol. 67, No. 5.
@article{ec887532bc664c25a816a481b5ac9939,
title = "Quantum random-walk search algorithm",
abstract = "Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with [Formula Presented] calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.",
author = "Neil Shenvi and Julia Kempe and Whaley, {K. Birgitta}",
year = "2003",
month = "1",
day = "1",
doi = "10.1103/PhysRevA.67.052307",
language = "English (US)",
volume = "67",
journal = "Physical Review A",
issn = "2469-9926",
publisher = "American Physical Society",
number = "5",

}

TY - JOUR

T1 - Quantum random-walk search algorithm

AU - Shenvi, Neil

AU - Kempe, Julia

AU - Whaley, K. Birgitta

PY - 2003/1/1

Y1 - 2003/1/1

N2 - Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with [Formula Presented] calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.

AB - Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with [Formula Presented] calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84871218097&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871218097&partnerID=8YFLogxK

U2 - 10.1103/PhysRevA.67.052307

DO - 10.1103/PhysRevA.67.052307

M3 - Article

VL - 67

JO - Physical Review A

JF - Physical Review A

SN - 2469-9926

IS - 5

ER -