{
  "annotation_id": "5e586abb-8a1e-44ff-8a84-662368dc0387",
  "date_created": "2026-03-02T18:01:42.469000Z",
  "date_modified": "2026-03-02T18:01:42.469000Z",
  "file_hash": "c479367a8e0805591deac7227e4fb5fd061b60d362e618847d864216f0285049",
  "private": false,
  "record": {
    "abstract": "In this note, we discuss a general definition of quantum random walks on\ngraphs and illustrate with a simple graph the possibility of very different\nbehavior between a classical random walk and its quantum analogue. In this\ngraph, propagation between a particular pair of nodes is exponentially faster\nin the quantum case.",
    "arxiv_id": "quant-ph/0103020",
    "authors": [
      "Andrew M. Childs",
      "Edward Farhi",
      "Sam Gutmann"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1023/A:1019609420309",
    "journal_ref": "Quantum Information Processing 1, 35 (2002)",
    "title": "An example of the difference between quantum and classical random walks",
    "url": "https://arxiv.org/abs/quant-ph/0103020"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "22f199d6-aec5-4612-986d-e6aa886dcdb8",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}