{
  "annotation_id": "47e2d454-b78f-482b-afe6-03d361527be5",
  "date_created": "2026-03-02T18:02:27.733000Z",
  "date_modified": "2026-03-02T18:02:27.733000Z",
  "file_hash": "d249c4af5f8ed40e0f1e251f5aa60a4433f01f5175c19d7d4b4c56cb68f0371e",
  "private": false,
  "record": {
    "abstract": "We create a variety of new quantum algorithms that use Grover\u0027s algorithm and\nsimilar techniques to give polynomial speedups over their classical\ncounterparts. We begin by introducing a set of tools that carefully minimize\nthe impact of errors on running time; those tools provide us with speedups to\nalready-published quantum algorithms, such as improving Durr, Heiligman, Hoyer\nand Mhalla\u0027s algorithm for single-source shortest paths [quant-ph/0401091] by a\nfactor of lg N. The algorithms we construct from scratch have a range of\nspeedups, from O(E)-\u003eO(sqrt(VE lg V)) speedups in graph theory to an\nO(N^3)-\u003eO(N^2) speedup in dynamic programming.",
    "arxiv_id": "quant-ph/0606127",
    "authors": [
      "Bartholomew Furrow"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Panoply of Quantum Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0606127"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fc6e9ef5-b5bc-4f0b-b95b-15a297d50940",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}