{
  "annotation_id": "bf7f31ea-f03e-444f-831a-21391e1c39dc",
  "date_created": "2026-03-02T18:02:13.039000Z",
  "date_modified": "2026-03-02T18:02:13.039000Z",
  "file_hash": "1a26fef003bc088d1163023ab0beff0fe8c972ddbb6bbe2a70dc7b0046d5a794",
  "private": false,
  "record": {
    "abstract": "We develop the probabilistic implementation of a nonlocal gate\n$\\exp{[i\\xi{\\sigma_{n_A}}\\sigma_{n_B}]}$ and $\\xi\\in[0,\\frac\\pi4]$, by using a\nsingle non-maximally entangled state. We prove that, nonlocal gates can be\nimplemented with a fidelity greater than 79.3% and a consumption of less than\n0.969 ebits and 2 classical bits, when $\\xi\\leq0.353$. This provides a higher\nbound for the feasible operation compared to the former techniques\n\\cite{Cirac,Groisman,Bennett-1}. Besides, gates with $\\xi\\geq0.353$ can be\nimplemented with the probability 79.3% and a consumption of 0.969 ebits, which\nis the same efficiency as the distillation-based protocol\n\\cite{Groisman,Bennett-1}, while our method saves extra classical resource.\nGates with $\\xi\\to0$ can be implemented with nearly unit probability and a\nsmall entanglement. We also generalize some application to the multiple system,\nwhere we find it is possible to implement certain nonlocal gates between many\nnon-entangled partners using a non-maximally multiple entangled state.",
    "arxiv_id": "quant-ph/0501107",
    "authors": [
      "Lin Chen",
      "Yi-Xin Chen"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.71.054302",
    "title": "Probabilistically implementing nonlocal operation using non-maximally   entangled state",
    "url": "https://arxiv.org/abs/quant-ph/0501107"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d6ca8896-8f17-4eac-b6ef-d5341ebf4300",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}