{
  "annotation_id": "a5fcada2-cac2-4f2b-ad0c-534974da0554",
  "date_created": "2026-03-02T18:01:56.330000Z",
  "date_modified": "2026-03-02T18:01:56.330000Z",
  "file_hash": "707a75db676f51025f557631e37ec099233b14996ae825e9354540decc51aef4",
  "private": false,
  "record": {
    "abstract": "Quantum algorithms for several problems in graph theory are considered.\nClassical algorithms for finding the lowest weight path between two points in a\ngraph and for finding a minimal weight spanning tree involve searching over\nsome space. Modification of classical algorithms due to Dijkstra and Prim\nallows quantum search to replace classical search and leads to more efficient\nalgorithms. In the case of highly asymmetric complete bipartite graphs, simply\nreplacing classical search with quantum search leads to a faster quantum\nalgorithm. A fast quantum algorithm for computing the diameter of a complete\ngraph is also given.",
    "arxiv_id": "quant-ph/0303131",
    "authors": [
      "Mark Heiligman"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Algorithms for Lowest Weight Paths and Spanning Trees in   Complete Graphs",
    "url": "https://arxiv.org/abs/quant-ph/0303131"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ba11de69-f7a0-4064-adef-e5fd7607b6a2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}