{
  "annotation_id": "9dac91a9-558f-4bc8-9fa3-c8254c5936dc",
  "date_created": "2026-03-02T18:01:45.411000Z",
  "date_modified": "2026-03-02T18:01:45.411000Z",
  "file_hash": "87f1a7514f1ec7e170d473db199783222bef792c3ac47526fb5f5cf7725d125b",
  "private": false,
  "record": {
    "abstract": "Recently, several groups have investigated quantum analogues of random walk\nalgorithms, both on a line and on a circle. It has been found that the quantum\nversions have markedly different features to the classical versions. Namely,\nthe variance on the line, and the mixing time on the circle increase\nquadratically faster in the quantum versions as compared to the classical\nversions. Here, we propose a scheme to implement the quantum random walk on a\nline and on a circle in an ion trap quantum computer. With current ion trap\ntechnology, the number of steps that could be experimentally implemented will\nbe relatively small. However, we show how the enhanced features of these walks\ncould be observed experimentally. In the limit of strong decoherence, the\nquantum random walk tends to the classical random walk. By measuring the degree\nto which the walk remains `quantum\u0027, this algorithm could serve as an important\nbenchmarking protocol for ion trap quantum computers.",
    "arxiv_id": "quant-ph/0109076",
    "authors": [
      "B. C. Travaglione",
      "G. J. Milburn"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.65.032310",
    "journal_ref": "Physical Review A, Vol 65, 032310 (2002)",
    "title": "Implementing the quantum random walk",
    "url": "https://arxiv.org/abs/quant-ph/0109076"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "dad2a4aa-0f26-47cc-bc69-243af0e64dd9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}