{
  "annotation_id": "54c83925-4dcb-449f-a1b3-22f167baa7dd",
  "date_created": "2026-03-02T18:01:39.152000Z",
  "date_modified": "2026-03-02T18:01:39.152000Z",
  "file_hash": "2d20755cdffe70b0fbbadc562d69af5bcbd279f00f261077db0e88b8f0fbc84f",
  "private": false,
  "record": {
    "abstract": "I present a simple two-party quantum communication complexity protocol with\nhigher success rate than the best possible classical protocol for the same\ntask. The quantum protocol is shown to be equivalent to a quantum non-locality\ntest, except that it is not necessary to close the locality loophole. I derive\nbounds for the detector efficiency and background count rates necessary for an\nexperimental implementation and show that they are close to what can be\ncurrently achieved using ion trap technology. I also analyze the requirements\nfor a three-party protocol and show that they are less demanding than those for\nthe two-party protocol. The results can be interpreted as sufficient\nexperimental conditions for quantum non-locality tests using two or three\nentangled qubits.",
    "arxiv_id": "quant-ph/0009014",
    "authors": [
      "Ernesto F. Galvao"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Experimental requirements for quantum communication complexity protocols",
    "url": "https://arxiv.org/abs/quant-ph/0009014"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f241aa12-d66f-4364-a3a8-70e443a88cd1",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}