{
  "annotation_id": "0f593edf-4456-4cdf-8df4-ec6b35f9b968",
  "date_created": "2026-03-02T18:02:10.428000Z",
  "date_modified": "2026-03-02T18:02:10.428000Z",
  "file_hash": "8bdfaa037792358d3237d39210298d318be8845f62be2388602cfe2b0e6e6076",
  "private": false,
  "record": {
    "abstract": "In this paper, the problem of finding optimal success probabilities of static\nlinear optics quantum gates is linked to the theory of convex optimization. It\nis shown that by exploiting this link, upper bounds for the success probability\nof networks realizing single-mode gates can be derived, which hold in\ngenerality for linear optical networks followed by postselection, i.e., for\nnetworks of arbitrary size, any number of auxiliary modes, and arbitrary photon\nnumbers. As a corollary, the previously formulated conjecture is proven that\nthe optimal success probability of a postselected non-linear sign shift without\nfeed-forward is 1/4, a gate playing the central role in the scheme of\nKnill-Laflamme-Milburn for quantum computation with linear optics. The concept\nof Lagrange duality is shown to be applicable to provide rigorous proofs for\nsuch bounds for elementary gates, although the original problem is a difficult\nnon-convex problem in infinitely many objective variables. The versatility of\nthis approach to identify other optimal linear optical schemes is demonstrated.",
    "arxiv_id": "quant-ph/0409156",
    "authors": [
      "J. Eisert"
    ],
    "categories": [
      "quant-ph",
      "math.OC"
    ],
    "doi": "10.1103/PhysRevLett.95.040502",
    "journal_ref": "Phys. Rev. Lett. 95, 040502 (2005)",
    "title": "Optimizing linear optics quantum gates",
    "url": "https://arxiv.org/abs/quant-ph/0409156"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a30de9ef-dcb6-45ee-87e0-7ed58218898b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}