{
  "annotation_id": "da5c2505-e864-40db-9b3c-6bc293b88252",
  "date_created": "2026-03-02T18:01:59.486000Z",
  "date_modified": "2026-03-02T18:01:59.486000Z",
  "file_hash": "e30c29b72a0f1ee24384db3de4b943683c345686cc989e9df6f346b7df6d3292",
  "private": false,
  "record": {
    "abstract": "Quantum walks, both discrete (coined) and continuous time, on a general graph\nof N vertices with undirected edges are reviewed in some detail. The resource\nrequirements for implementing a quantum walk as a program on a quantum computer\nare compared and found to be very similar for both discrete and continuous time\nwalks. The role of the oracle, and how it changes if more prior information\nabout the graph is available, is also discussed.",
    "arxiv_id": "quant-ph/0306140",
    "authors": [
      "Viv Kendon"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1142/S0219749906002195",
    "journal_ref": "Int. J. Quantum Info. Vol. 4, No. 5 (2006) 791-805",
    "title": "Quantum walks on general graphs",
    "url": "https://arxiv.org/abs/quant-ph/0306140"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0bd2eccf-214c-4166-adf2-f25dba9f5ca1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}