Work

Quantum random-walk search algorithm

Year: 2003

Type: article

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 $O(\sqrt{N})$ 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.

Source: Physical Review A

DOI: 10.1103/physreva.67.052307

Authors: Neil Shenvi, Julia Kempe, K. Birgitta Whaley

Institutions: University of California, Berkeley, Université Paris-Sud, Centre National de la Recherche Scientifique, Laboratoire de Recherche en Informatique

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Science Foundation, Defense Advanced Research Projects Agency, U.S. Air Force, Advanced Research Projects Agency

Award: ITR/SY: Discrete Models & Algorithms in the Sciences