{
  "annotation_id": "d3cbd016-5d0b-4adc-9f5d-ba5a9b024f8f",
  "date_created": "2026-03-02T18:02:09.547000Z",
  "date_modified": "2026-03-02T18:02:09.547000Z",
  "file_hash": "062f6e6de72a500e10476f9c2df23ea0c112ef96cc7b96c6b024bcc3adf8938d",
  "private": false,
  "record": {
    "abstract": "Quantum computations usually take place under the control of the classical\nworld. We introduce a Classically-controlled Quantum Turing Machine (CQTM)\nwhich is a Turing Machine (TM) with a quantum tape for acting on quantum data,\nand a classical transition function for a formalized classical control. In\nCQTM, unitary transformations and measurements are allowed. We show that any\nclassical TM is simulated by a CQTM without loss of efficiency. The gap between\nclassical and quantum computations, already pointed out in the framework of\nmeasurement-based quantum computation is confirmed. To appreciate the\nsimilarity of programming classical TM and CQTM, examples are given.",
    "arxiv_id": "quant-ph/0407008",
    "authors": [
      "Simon Perdrix",
      "Philippe Jorrand"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "doi": "10.1017/S096012950600538X",
    "journal_ref": "Math. Struct. in Comp. Science, 16:601-620, 2006",
    "title": "Classically-Controlled Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/0407008"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "313c0936-8bd3-468e-a02e-a45592fb0c7f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}