{
  "annotation_id": "e0728644-946e-41da-bb87-6f1067f0a902",
  "date_created": "2026-03-02T18:02:05.878000Z",
  "date_modified": "2026-03-02T18:02:05.878000Z",
  "file_hash": "d6e0030df0a96cb27fb9ba0274f7b201f202cd19e780a7c93751416d17a7e60f",
  "private": false,
  "record": {
    "abstract": "We develop an abstract way of defining linear-optics networks designed to\nperform quantum information tasks such as quantum gates. We will be mainly\nconcerned with the nonlinear sign shift gate, but it will become obvious that\nall other gates can be treated in a similar manner. The abstract scheme is\nextremely well suited for analytical as well as numerical investigations since\nit reduces the number of parameters for a general setting. With that we show\nnumerically and partially analytically for a wide class of states that the\nsuccess probability of generating a nonlinear sign shift gate does not exceed\n1/4 which to our knowledge is the strongest bound to date.",
    "arxiv_id": "quant-ph/0403103",
    "authors": [
      "Stefan Scheel",
      "Norbert Luetkenhaus"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/1367-2630/6/1/051",
    "title": "Upper bounds on success probabilities in linear optics",
    "url": "https://arxiv.org/abs/quant-ph/0403103"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "622f1ef2-b49f-4bcd-8f2e-676241e4575f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}