{
  "annotation_id": "e94cadfc-aab8-4219-b8d7-6280b0c47096",
  "date_created": "2026-03-02T18:01:59.603000Z",
  "date_modified": "2026-03-02T18:01:59.603000Z",
  "file_hash": "9018f77a1779a9d4d6d3634ee39c802a6b3dd19132bef9cdfef487965e8fcaeb",
  "private": false,
  "record": {
    "abstract": "It is well known, and appreciated, that quantum computers have the potential\nto be the most powerful computational devices ever created. This newfound power\ncomes from a quantum parallelism effect that allows the computer to be in\nmultiple states at the same time. This property of quantum parallelism, while\nsuited to handle common problems such as factoring and searching an unorganized\ndatabase, is extremely well-suited to handle the task of solving a binary maze.\nI propose an algorithm that can be used to solve a binary maze on a quantum\ncomputer, with guaranteed accuracy. While it does work, it does come with a few\nsetbacks, in that the maze must have no flaws, and that the computer requires a\nnumber of qubits equal to the number of decisions in the maze, plus log 2 of\nthe decisions.",
    "arxiv_id": "quant-ph/0304146",
    "authors": [
      "Mark A Bashuk"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Solving a Maze With a Quantum Computer",
    "url": "https://arxiv.org/abs/quant-ph/0304146"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "cf17b1e5-bf0d-44f4-9811-844db6ca1e26",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}