{
  "annotation_id": "4a3fcbab-c045-4675-a421-31ea12be4355",
  "date_created": "2026-03-02T18:02:05.809000Z",
  "date_modified": "2026-03-02T18:02:05.809000Z",
  "file_hash": "e47f5e88c43c64260e80e2bc9d3a6680114f355240c3626316e1ddeba0bfbd85",
  "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/0402156",
    "authors": [
      "Simon Perdrix",
      "Philippe Jorrand"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Measurement-Based Quantum Turing Machines and Questions of   Universalities",
    "url": "https://arxiv.org/abs/quant-ph/0402156"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5e49bcfe-9181-4b5d-b261-4bc627f96d66",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}