A Panoply of Quantum Algorithms
| dc.creator | Furrow, Bartholomew | |
| dc.date | 2006-06-15 | |
| dc.date.accessioned | 2026-07-07T07:19:04Z | |
| dc.date.available | 2026-07-07T07:19:04Z | |
| dc.description | 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. | |
| dc.description | 32 pages. Presented at CIAR Quantum Information Processing meeting, May 2006 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0606127 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0606127 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/114524 | |
| dc.subject | Quantum Physics | |
| dc.title | A Panoply of Quantum Algorithms | |
| dc.type | text |