A panoply of quantum algorithms

@article{Furrow2008APO,
  title={A panoply of quantum algorithms},
  author={Bartholomew Furrow},
  journal={Quantum Information & Computation},
  year={2008},
  volume={8},
  pages={834-859}
}
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 Dürr, Heiligman, Høyer and Mhalla’s algorithm for single-source shortest paths[1] by a factor of lg N . The algorithms we construct from… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…