{
  "annotation_id": "cd22f748-19ae-4510-81bd-d85045598d16",
  "date_created": "2026-03-02T18:02:06.147000Z",
  "date_modified": "2026-03-02T18:02:06.147000Z",
  "file_hash": "75403882427de741381abce1bd7bfb5fc3eafc93f6d218255dd490cd76c22aaa",
  "private": false,
  "record": {
    "abstract": "Classical randomized algorithms use a coin toss instruction to explore\ndifferent evolutionary branches of a problem. Quantum algorithms, on the other\nhand, can explore multiple evolutionary branches by mere superposition of\nstates. Discrete quantum random walks, studied in the literature, have\nnonetheless used both superposition and a quantum coin toss instruction. This\nis not necessary, and a discrete quantum random walk without a quantum coin\ntoss instruction is defined and analyzed here. Our construction eliminates\nquantum entanglement from the algorithm, and the results match those obtained\nwith a quantum coin toss instruction.",
    "arxiv_id": "quant-ph/0405128",
    "authors": [
      "Apoorva Patel",
      "K. S. Raghunathan",
      "Pranaw Rungta"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.71.032347",
    "journal_ref": "Phys. Rev. A71 (2005) 032347",
    "title": "Quantum Random Walks do not need a Coin Toss",
    "url": "https://arxiv.org/abs/quant-ph/0405128"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "00d72ef8-84c6-4d0c-bd96-bcf9e83e0539",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}