{
  "annotation_id": "06fdd976-8a01-46e2-bcab-30e6c7f4b92a",
  "date_created": "2026-03-02T18:02:30.616000Z",
  "date_modified": "2026-03-02T18:02:30.616000Z",
  "file_hash": "74de0f570b2a618f7a1b319198fd01dd7d8ff46fb13e8634d6a3643ca79aa4bf",
  "private": false,
  "record": {
    "abstract": "Consider a function where its entries are distributed among many parties.\nSuppose each party is allowed to transmit only a limited amount of information\nto a net. One can use a classical protocol to guess the value of the global\nfunction. Is there a quantum protocol improving the results of all classical\nprotocols? Brukner et. al. showed the deep connection between such problems and\nthe theory of Bell\u0027s inequalities. Here we generalize the theory to trits.\nThere the best classical protocol fails whereas the quantum protocol yields the\ncorrect answer.",
    "arxiv_id": "quant-ph/0608156",
    "authors": [
      "B. Tamir"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.75.032344",
    "title": "Communication Complexity Protocol for Q-trits",
    "url": "https://arxiv.org/abs/quant-ph/0608156"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "13434407-9f3a-4170-af60-8c5b9d7843c8",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}