{
  "annotation_id": "f895a979-3795-4332-80a8-3ac2d5492fa3",
  "date_created": "2026-03-02T18:01:38.743000Z",
  "date_modified": "2026-03-02T18:01:38.743000Z",
  "file_hash": "a12665f78b5735d1b5c3114afa9623fbf9c448366067d379c6db9b834683581f",
  "private": false,
  "record": {
    "abstract": "We investigate the minimal resources that are required in the local\nimplementation of non-local quantum gates in a distributed quantum computer.\nBoth classical communication requirements and entanglement consumption are\ninvestigated. We present general statements on the minimal resource\nrequirements and present optimal procedures for a number of important gates,\nincluding CNOT and Toffoli gates. We show that one bit of classical\ncommunication in each direction is both necessary and sufficient for the\nnon-local implementation of the quantum CNOT, while in general two bits in each\ndirection is required for the implementation of a general two bit quantum gate.\nIn particular, the state-swapper requires this maximum classical communication\noverhead. Extensions of these ideas to multi-party gates are presented.",
    "arxiv_id": "quant-ph/0005101",
    "authors": [
      "J. Eisert",
      "K. Jacobs",
      "P. Papadopoulos",
      "M. B. Plenio"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.62.052317",
    "journal_ref": "Phys. Rev. A 62 (2000) 052317",
    "title": "Optimal local implementation of non-local quantum gates",
    "url": "https://arxiv.org/abs/quant-ph/0005101"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "31fd3e99-9b79-4cd7-8e3a-edd5919fc31f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}