{
  "annotation_id": "0bdf790f-4c0b-453f-98b8-6dd428b726f9",
  "date_created": "2026-03-02T18:01:56.501000Z",
  "date_modified": "2026-03-02T18:01:56.501000Z",
  "file_hash": "4674707e30cfe296ce4392f50eab13f3b73bfa0937ae7857a39919d800172929",
  "private": false,
  "record": {
    "abstract": "We give a detailed account of the one-way quantum computer, a scheme of\nquantum computation that consists entirely of one-qubit measurements on a\nparticular class of entangled states, the cluster states. We prove its\nuniversality, describe why its underlying computational model is different from\nthe network model of quantum computation and relate quantum algorithms to\nmathematical graphs. Further we investigate the scaling of required resources\nand give a number of examples for circuits of practical interest such as the\ncircuit for quantum Fourier transformation and for the quantum adder. Finally,\nwe describe computation with clusters of finite size.",
    "arxiv_id": "quant-ph/0301052",
    "authors": [
      "R. Raussendorf",
      "D. E. Browne",
      "H. J. Briegel"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.68.022312",
    "journal_ref": "Phys. Rev. A 68, 022312 (2003).",
    "title": "Measurement-based quantum computation with cluster states",
    "url": "https://arxiv.org/abs/quant-ph/0301052"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "abce7dbe-1d92-4f37-b0f6-089b162b6f5e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}