{
  "annotation_id": "37394c55-9439-4362-ab2b-e729567cfc74",
  "date_created": "2026-03-02T18:01:38.961000Z",
  "date_modified": "2026-03-02T18:01:38.961000Z",
  "file_hash": "a745f472a07a3ac00a3465a20e707b492b21efe38c4acc59cd270705aa21af1c",
  "private": false,
  "record": {
    "abstract": "Quantum robots are described as mobile quantum computers and ancillary\nsystems that move in and interact with arbitrary environments. Their dynamics\nis given as tasks which consist of sequences of alternating computation and\naction phases. A task example is considered in which a quantum robot searches a\nspace region to find the location of a system. The possibility that the search\ncan be more efficient than a classical search is examined by considering use of\nGrover\u0027s Algorithm to process the search results. For reversible searches this\nis problematic for two reasons. One is the removal of entanglements generated\nby the search process. The other is that even if the entanglement can be\navoided, the search process in 2-D space regions is no more efficient than a\nclassical search. However, quantum searches of space regions with 3 or more\ndimensions are more efficient than classical searches. Reasons why quantum\nrobots are interesting independent of these results are briefly summarized.",
    "arxiv_id": "quant-ph/0003006",
    "authors": [
      "Paul Benioff"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "AMS Contemporary Math Series, Vol 305, (2002)",
    "title": "Space Searches with a Quantum Robot",
    "url": "https://arxiv.org/abs/quant-ph/0003006"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "39e322d4-b478-45d9-8237-4c3c0a1059b0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}