{
  "annotation_id": "5e77f632-92fc-44a0-ae87-f7404562ec94",
  "date_created": "2026-03-02T18:01:49.490000Z",
  "date_modified": "2026-03-02T18:01:49.490000Z",
  "file_hash": "cc0937d07a745a9bee19d0bfa9b8c3f0192a601b4021ce0b8780ca5c0dfbca1d",
  "private": false,
  "record": {
    "abstract": "Nielsen [quant-ph/0108020] showed that universal quantum computation is\npossible given quantum memory and the ability to perform projective\nmeasurements on up to 4-qubits. We describe an improved method that requires\nonly 2-qubit measurements, which are both sufficient and necessary. We present\na method to partially collapse the $C_k$-hierarchy in the indirect construction\nof unitary gates [Gottesman and Chuang, Nature, {\\bf 402} 309 (1999)], and\napply the method to find discrete universal sets of 2-qubit measurements.",
    "arxiv_id": "quant-ph/0111122",
    "authors": [
      "D. W. Leung"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Two-qubit Projective Measurements are Universal for Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/0111122"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7dd6136e-e709-4298-9365-a74d69eaf411",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}