{
  "annotation_id": "d7ac0228-d463-4dc9-a22b-2532fad9498d",
  "date_created": "2026-03-02T18:02:24.006000Z",
  "date_modified": "2026-03-02T18:02:24.006000Z",
  "file_hash": "31b7d0aaf201fe6f3b69844de2023209f4a4cad2b7e5925954b90529cccedcd9",
  "private": false,
  "record": {
    "abstract": "Linear optics with photon counting is a prominent candidate for practical\nquantum computing. The protocol by Knill, Laflamme, and Milburn [Nature 409, 46\n(2001)] explicitly demonstrates that efficient scalable quantum computing with\nsingle photons, linear optical elements, and projective measurements is\npossible. Subsequently, several improvements on this protocol have started to\nbridge the gap between theoretical scalability and practical implementation. We\nreview the original theory and its improvements, and we give a few examples of\nexperimental two-qubit gates. We discuss the use of realistic components, the\nerrors they induce in the computation, and how these errors can be corrected.",
    "arxiv_id": "quant-ph/0512071",
    "authors": [
      "Pieter Kok",
      "W. J. Munro",
      "Kae Nemoto",
      "T. C. Ralph",
      "Jonathan P. Dowling",
      "G. J. Milburn"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/RevModPhys.79.135",
    "journal_ref": "Rev. Mod. Phys. 79, 135 (2007).",
    "title": "Review article: Linear optical quantum computing",
    "url": "https://arxiv.org/abs/quant-ph/0512071"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a2b0bd3b-bf5e-478d-b16b-4a459454fff6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}