{
  "annotation_id": "9d71af62-3c04-4819-9124-6ea79358d80f",
  "date_created": "2026-03-02T18:02:06.813000Z",
  "date_modified": "2026-03-02T18:02:06.813000Z",
  "file_hash": "edd25676e5bc4b8cccb9e8d189a60b488c36f52961159dbdb62ecdc2d24f738c",
  "private": false,
  "record": {
    "abstract": "Quantum measurement is universal for quantum computation. This universality\nallows alternative schemes to the traditional three-step organisation of\nquantum computation: initial state preparation, unitary transformation,\nmeasurement. In order to formalize these other forms of computation, while\npointing out the role and the necessity of classical control in\nmeasurement-based computation, and for establishing a new upper bound of the\nminimal resources needed to quantum universality, a formal model is introduced\nby means of Measurement-based Quantum Turing Machines.",
    "arxiv_id": "quant-ph/0404146",
    "authors": [
      "Simon Perdrix",
      "Philippe Jorrand"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Measurement-Based Quantum Turing Machines and their Universality",
    "url": "https://arxiv.org/abs/quant-ph/0404146"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "caca7b57-d64c-49cf-aa28-1b08d2af089a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}