A Panoply of Quantum Algorithms
量子物理
2007-05-23 v1
摘要
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.
引用
@article{arxiv.quant-ph/0606127,
title = {A Panoply of Quantum Algorithms},
author = {Bartholomew Furrow},
journal= {arXiv preprint arXiv:quant-ph/0606127},
year = {2007}
}
备注
32 pages. Presented at CIAR Quantum Information Processing meeting, May 2006