{
  "annotation_id": "c9f085c7-43be-40a4-823c-7f72c29e8173",
  "date_created": "2026-03-02T18:02:13.696000Z",
  "date_modified": "2026-03-02T18:02:13.696000Z",
  "file_hash": "ee6c5ea559261e2a084408f317f7cb39ad49c2f30c0880a9fec904c8ed0238f1",
  "private": false,
  "record": {
    "abstract": "Recently, it was shown that fundamental gates for theoretically efficient\nquantum information processing can be realized by using single photon sources,\nlinear optics and quantum counters. One of these fundamental gates is the\nNS-gate, that is, the one-mode non-linear sign shift. In this work, firstly, we\nprove by a new rigorous proof that the upper bound of success probability of\nNS-gates with only one helper photon and an undefined number of ancillary modes\nis bounded by 0.25. Secondly, we explore the upper bound of success probability\nof NS-gate with a new post-selection measurement. The idea behind this new\npost-selection measurement is to condition the success of NS-gate\ntransformation to the observation of only one helper photon in whichever of the\noutput modes.",
    "arxiv_id": "quant-ph/0412207",
    "authors": [
      "R. Coen Cagli",
      "P. Aniello",
      "N. Cesario",
      "F. Foncellino"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Int.J.Quant.Inf. 3 (2005) 611-621",
    "title": "Exploring a New Post-Selection Condition for Efficient Linear Optics   Quantum Computation",
    "url": "https://arxiv.org/abs/quant-ph/0412207"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "da3f6864-d0db-461e-ad46-13a7665bbc46",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}