{
  "annotation_id": "3f6d4dbb-ff92-49a3-9525-223b1bfb62d3",
  "date_created": "2026-03-02T18:01:59.865000Z",
  "date_modified": "2026-03-02T18:01:59.865000Z",
  "file_hash": "1060d8f2dd3c5a37c4c1a288bb3f1bae86ceeb454291c9923e8466493e5a4546",
  "private": false,
  "record": {
    "abstract": "The fundamental gates of linear optics quantum computation are realized by\nusing single photons sources, linear optics and photon counters. Success of\nthese gates is conditioned on the pattern of photons detected without using\nfeedback. Here it is shown that the maximum probability of success of these\ngates is typically strictly less than 1. For the one-mode non-linear sign\nshift, the probability of success is bounded by 1/2. For the conditional sign\nshift of two modes, this probability is bounded by 3/4. These bounds are still\nsubstantially larger than the highest probabilities shown to be achievable so\nfar, which are 1/4 and 2/27, respectively.",
    "arxiv_id": "quant-ph/0307015",
    "authors": [
      "E. Knill"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.68.064303",
    "title": "Bounds on the Probability of Success of Postselected Non-linear Sign   Shifts Implemented with Linear Optics",
    "url": "https://arxiv.org/abs/quant-ph/0307015"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "02b25f6d-6f6a-4e37-a1a1-30a53a609b7a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}