{
  "annotation_id": "1f4df770-92e7-4fe7-9d5f-7d947cd8d24a",
  "date_created": "2026-03-02T18:01:45.190000Z",
  "date_modified": "2026-03-02T18:01:45.190000Z",
  "file_hash": "298a57a4ad28070f13a7cd94cc4e3316522c77120b4369fe2d576a00f8e39933",
  "private": false,
  "record": {
    "abstract": "This paper studies privacy and secure function evaluation in communication\ncomplexity. The focus is on quantum versions of the model and on protocols with\nonly approximate privacy against honest players. We show that the privacy loss\n(the minimum divulged information) in computing a function can be decreased\nexponentially by using quantum protocols, while the class of privately\ncomputable functions (i.e., those with privacy loss 0) is not enlarged by\nquantum protocols. Quantum communication combined with small information\nleakage on the other hand makes certain functions computable (almost) privately\nwhich are not computable using either quantum communication without leakage or\nclassical communication with leakage. We also give an example of an exponential\nreduction of the communication complexity of a function by allowing a privacy\nloss of $o(1)$ instead of privacy loss 0.",
    "arxiv_id": "quant-ph/0110038",
    "authors": [
      "Hartmut Klauck"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s00224-003-1113-7",
    "journal_ref": "Theory of Computing Systems vol.37(1), pp.221-246, 2004.",
    "title": "On quantum and approximate privacy",
    "url": "https://arxiv.org/abs/quant-ph/0110038"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "cafd17e9-30ec-49ca-8b3d-0651396d58a4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}