Efficient quantum circuit implementation of quantum walks

Details Efficient quantum circuit implementation of quantum walks Efficient quantum circuit implementation of quantum walks

2007-06-03

arxiv.org/abs/0706.0304v3

Physics

Quantum Physics

Scientific paper

Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides an exponential speedup over classical methods, relative to a particular quantum oracle. Here, we discuss the possibility of a quantum walk algorithm yielding such an exponential speedup over possible classical algorithms, without the use of an oracle. We provide examples of some highly symmetric graphs on which efficient quantum circuits implementing quantum walks can be constructed, and discuss potential applications to quantum search for marked vertices along these graphs.

Affiliated with

Also associated with

No associations

Rating

Efficient quantum circuit implementation of quantum walks 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 Efficient quantum circuit implementation of quantum walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient quantum circuit implementation of quantum walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688946