{
  "annotation_id": "eb2c2b23-fcfd-4644-bbf6-87322aa976af",
  "date_created": "2026-03-02T18:02:10.394000Z",
  "date_modified": "2026-03-02T18:02:10.394000Z",
  "file_hash": "c8db8f7a41c1b0cad76e69b2093d2f0b58e1723f2cb95cb96353b0d449f2943d",
  "private": false,
  "record": {
    "abstract": "Recent works have independently suggested that Quantum Mechanics might permit\nfor procedures that transcend the power of Turing Machines as well as of\n`standard\u0027 Quantum Computers. These approaches rely on and indicate that\nQuantum Mechanics seems to support some infinite variant of classical parallel\ncomputing. We compare this new one with other attempts towards hypercomputation\nby separating 1) its principal computing capabilities from 2) realizability\nissues. The first are shown to coincide with recursive enumerability; the\nsecond are considered in analogy to `existence\u0027 in mathematical logic.",
    "arxiv_id": "quant-ph/0410141",
    "authors": [
      "Martin Ziegler"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s10773-005-8984-0",
    "journal_ref": "pp.2059-2071 in International Journal of Theoretical Physics\n  vol.44:11 (2005)",
    "title": "Does Quantum Mechanics allow for Infinite Parallelism?",
    "url": "https://arxiv.org/abs/quant-ph/0410141"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c7b6c9e1-4bad-49ce-b1af-fc0a88c72064",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}