{
  "annotation_id": "614a8817-31c8-4b09-91ef-d18944e5af2e",
  "date_created": "2026-03-02T18:02:13.450000Z",
  "date_modified": "2026-03-02T18:02:13.450000Z",
  "file_hash": "7e7e99267231f56ebe8b9f4ba78007a982d6405fa4ecd6eb3e83dfe380a5160c",
  "private": false,
  "record": {
    "abstract": "We propose and study a method for using non-maximally entangled states to\nimplement probabilistically non-local gates. Unlike distillation-based\nprotocols, this method does not generate a maximally entangled state at\nintermediate stages of the process. As a consequences, the method becomes more\nefficient at a certain range of parameters. Gates of the form\n$\\exp[i\\xi\\sigma_{n_A}\\sigma_{n_B}]$ with $\\xi\\ll1$, can be implemented with\nnearly unit probability and with vanishingly small entanglement, while for the\ndistillation-based method the gate is produced with a vanishing success\nprobability. We also derive an upper bound to the optimal success probability\nand show that in the small entanglement limit, the bound is tight.",
    "arxiv_id": "quant-ph/0410170",
    "authors": [
      "Berry Groisman",
      "Benni Reznik"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.71.032322",
    "journal_ref": "Phys. Rev. A 71, 032322 (2005)",
    "title": "On the efficiency of nonlocal gates generation",
    "url": "https://arxiv.org/abs/quant-ph/0410170"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f9c09032-c79c-420e-bb72-e1f23e9cf75c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}