{
  "annotation_id": "4ac3894b-594b-498b-8dc0-2aeb76582fc8",
  "date_created": "2026-03-02T18:02:30.921000Z",
  "date_modified": "2026-03-02T18:02:30.921000Z",
  "file_hash": "165d9e9be98afd3372fb82a04fb5a553e791baf519f72d262e15a7f0594fbc79",
  "private": false,
  "record": {
    "abstract": "We give an exponential separation between one-way quantum and classical\ncommunication complexity for a Boolean function. Earlier such a separation was\nknown only for a relation. A very similar result was obtained earlier but\nindependently by Kerenidis and Raz [KR06]. Our version of the result gives an\nexample in the bounded storage model of cryptography, where the key is secure\nif the adversary has a certain amount of classical storage, but is completely\ninsecure if he has a similar amount of quantum storage.",
    "arxiv_id": "quant-ph/0607174",
    "authors": [
      "Dmytro Gavinsky",
      "Julia Kempe",
      "Ronald de Wolf"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "title": "Exponential Separation of Quantum and Classical One-Way Communication   Complexity for a Boolean Function",
    "url": "https://arxiv.org/abs/quant-ph/0607174"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6d88490d-b545-4603-9edb-3fcf7c568538",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}