{
  "annotation_id": "1221084a-11cd-46ac-858e-c0a494b66c04",
  "date_created": "2026-03-02T18:02:16.281000Z",
  "date_modified": "2026-03-02T18:02:16.281000Z",
  "file_hash": "6675437dce763944fe89533d7b6f2f05653194cb4e3affca95f550f806ebb79c",
  "private": false,
  "record": {
    "abstract": "We construct a quantum random walk algorithm, based on the Dirac operator\ninstead of the Laplacian. The algorithm explores multiple evolutionary branches\nby superposition of states, and does not require the coin toss instruction of\nclassical randomised algorithms. We use this algorithm to search for a marked\nvertex on a hypercubic lattice in arbitrary dimensions. Our numerical and\nanalytical results match the scaling behaviour of earlier algorithms that use a\ncoin toss instruction.",
    "arxiv_id": "quant-ph/0506221",
    "authors": [
      "Apoorva Patel",
      "K. S. Raghunathan",
      "Pranaw Rungta"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Random Walks without a Coin Toss",
    "url": "https://arxiv.org/abs/quant-ph/0506221"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9ce96fd3-3594-4bb0-8b44-20be7e7407cf",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}