{
  "annotation_id": "9b1e9c41-8bed-4323-a285-1c54602ac82f",
  "date_created": "2026-03-02T18:01:46.205000Z",
  "date_modified": "2026-03-02T18:01:46.205000Z",
  "file_hash": "46cf5c470e1946aaf9f0cfd27ef1e727b847fa5b745a853767c1e47233f37cf8",
  "private": false,
  "record": {
    "abstract": "I show that a simple multi-party communication task can be performed more\nefficiently with quantum communication than with classical communication, even\nwith low detection efficiency $\\eta$. The task is a communication complexity\nproblem in which distant parties need to compute a function of the distributed\ninputs, while minimizing the amount of communication between them. A realistic\nquantum optical setup is suggested that can demonstrate a five-party quantum\nprotocol with higher-than-classical performance, provided $\\eta\u003e0.33$ .",
    "arxiv_id": "quant-ph/0106121",
    "authors": [
      "Ernesto F. Galvao"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.65.012318",
    "journal_ref": "Phys. Rev. A 65, 012318 (2002)",
    "title": "A feasible quantum communication complexity protocol",
    "url": "https://arxiv.org/abs/quant-ph/0106121"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b0e6fda1-76be-4499-ace0-b5f4dd70422d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}