A Panoply of Quantum Algorithms

Details A Panoply of Quantum Algorithms A Panoply of Quantum Algorithms

2006-06-15

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

Physics

Quantum Physics

32 pages. Presented at CIAR Quantum Information Processing meeting, May 2006

Scientific paper

We create a variety of new quantum algorithms that use Grover's algorithm and similar techniques to give polynomial speedups over their classical counterparts. We begin by introducing a set of tools that carefully minimize the impact of errors on running time; those tools provide us with speedups to already-published quantum algorithms, such as improving Durr, Heiligman, Hoyer and Mhalla's algorithm for single-source shortest paths [quant-ph/0401091] by a factor of lg N. The algorithms we construct from scratch have a range of speedups, from O(E)->O(sqrt(VE lg V)) speedups in graph theory to an O(N^3)->O(N^2) speedup in dynamic programming.

Affiliated with

Also associated with

No associations

Rating

A Panoply of Quantum Algorithms 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 Panoply of Quantum Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Panoply of Quantum Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-607226