{
  "annotation_id": "8941e070-268c-4f54-b9d2-d5decd095a64",
  "date_created": "2026-03-02T18:02:12.850000Z",
  "date_modified": "2026-03-02T18:02:12.850000Z",
  "file_hash": "26423c970ed032c7a2a58c037c10fd12b8c14dc1ce37562525e009135f42afb7",
  "private": false,
  "record": {
    "abstract": "Classical Floyd-Warshall algorithm is used to solve all-pairs shortest path\nproblem on a directed graph. The classical algorithm runs in \\mathcal{O}\n(V^{3}) time where V represents the number of nodes. Here we have modified the\nalgorithm and proposed a quantum algorithm analogous to Floyd-Warshall\nalgorithm which exploits the superposition principle and runs in \\mathcal{O}\n(Vlog_{2}V) time.",
    "arxiv_id": "quant-ph/0502144",
    "authors": [
      "A. S. Gupta",
      "A. Pathak"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Floyd-Warshall Alorithm",
    "url": "https://arxiv.org/abs/quant-ph/0502144"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "99fb2a29-0465-4bb8-ac71-dafc48110ad9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}