{
  "annotation_id": "65b88968-4ae8-4c08-9195-ebc59241f6e4",
  "date_created": "2026-03-02T18:02:15.967000Z",
  "date_modified": "2026-03-02T18:02:15.967000Z",
  "file_hash": "6669ecbefa56d482c2757668967f8452c192e6e8858830f41319ab72293f29a5",
  "private": false,
  "record": {
    "abstract": "We consider the definition of quantum walks on directed graphs. Call a\ndirected graph reversible if, for each pair of vertices (i, j), if i is\nconnected to j then there is a path from j to i. We show that reversibility is\na necessary and sufficient condition for a directed graph to allow the notion\nof a discrete-time quantum walk, and discuss some implications of this\ncondition. We present a method for defining a \"partially quantum\" walk on\ndirected graphs that are not reversible.",
    "arxiv_id": "quant-ph/0504116",
    "authors": [
      "Ashley Montanaro"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Quantum Information and Computation, vol. 7, no. 1 (2007)",
    "title": "Quantum walks on directed graphs",
    "url": "https://arxiv.org/abs/quant-ph/0504116"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3a7f33ad-d370-4395-a359-8d16ccf6e68e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}