A Quantum Random Walk Search Algorithm

Details A Quantum Random Walk Search Algorithm A Quantum Random Walk Search Algorithm

2002-10-10

arxiv.org/abs/quant-ph/0210064v1

Phys. Rev. A, Vol. 67 (5), 052307 (2003)

Physics

Quantum Physics

13 pages, 3 figures

Scientific paper

10.1103/PhysRevA.67.052307

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 speed-up over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random walk architecture that provides such a speed-up. 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 speed-up 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.

Affiliated with

Also associated with

No associations

Rating

A Quantum Random Walk Search Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Quantum Random Walk Search Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Quantum Random Walk Search Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-542869