{
  "annotation_id": "449bf336-baed-473a-b123-e688b4214286",
  "date_created": "2026-03-02T18:02:06.879000Z",
  "date_modified": "2026-03-02T18:02:06.879000Z",
  "file_hash": "36af063063106573b792131e7717c2d8bac70309b8c669d72ebc7214f491528f",
  "private": false,
  "record": {
    "abstract": "We introduce a scheme for linear optics quantum computation, that makes no\nuse of teleported gates, and requires stable interferometry over only the\ncoherence length of the photons. We achieve a much greater degree of efficiency\nand a simpler implementation than previous proposals. We follow the \"cluster\nstate\" measurement based quantum computational approach, and show how cluster\nstates may be efficiently generated from pairs of maximally polarization\nentangled photons using linear optical elements. We demonstrate the\nuniversality and usefulness of generic parity measurements, as well as\nintroducing the use of redundant encoding of qubits to enable utilization of\ndestructive measurements - both features of use in a more general context.",
    "arxiv_id": "quant-ph/0405157",
    "authors": [
      "Daniel E. Browne",
      "Terry Rudolph"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.95.010501",
    "journal_ref": "Physical Review Letters 95, 010501 (2005)",
    "title": "Resource-efficient linear optical quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0405157"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ff984f0c-120c-403b-b872-e0df4a932310",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}