{
  "annotation_id": "3f2d4d5e-57d1-4224-bb81-e59a3184e1b4",
  "date_created": "2026-03-02T18:02:13.568000Z",
  "date_modified": "2026-03-02T18:02:13.568000Z",
  "file_hash": "069080fa0664f78381b8dcb1662e9dca400186817442c849f1183730fed964ec",
  "private": false,
  "record": {
    "abstract": "We prove that the fidelity of two exemplary communication complexity\nprotocols, allowing for an N-1 bit communication, can be exponentially improved\nby N-1 (unentangled) qubit communication. Taking into account, for a fair\ncomparison, all inefficiencies of state-of-the-art set-up, the experimental\nimplementation outperforms the best classical protocol, making it the candidate\nfor multi-party quantum communication applications.",
    "arxiv_id": "quant-ph/0502066",
    "authors": [
      "Pavel Trojek",
      "Christian Schmid",
      "Mohamed Bourennane",
      "Caslav Brukner",
      "Marek Zukowski",
      "Harald Weinfurter"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.72.050305",
    "journal_ref": "Phys. Rev. A 72, 050305(R) (2005)",
    "title": "Experimental quantum communication complexity",
    "url": "https://arxiv.org/abs/quant-ph/0502066"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "221380e3-c2a2-44e3-9c14-e781248a8804",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}