{
  "annotation_id": "df682555-24f6-43d8-abd3-536e99e7b6c0",
  "date_created": "2026-03-02T18:01:49.327000Z",
  "date_modified": "2026-03-02T18:01:49.327000Z",
  "file_hash": "07e27e35d0e0a73ff7089eea4eb1b0644ba8cdc18b7e46e96c304384bd771682",
  "private": false,
  "record": {
    "abstract": "In this article we establish new bounds on the quantum communication\ncomplexity of distributed problems. Specifically, we consider the amount of\ncommunication that is required to transform a bipartite state into another,\ntypically more entangled, state. We obtain lower bounds in this setting by\nstudying the Renyi entropy of the marginal density matrices of the distributed\nsystem.\n  The communication bounds on quantum state transformations also imply lower\nbounds for the model of communication complexity where the task consists of the\nthe distributed evaluation of a function f(x,y). Our approach encapsulates\nseveral known lower bound methods that use the log-rank or the von Neumann\nentropy of the density matrices involved. The technique is also effective for\nproving lower bounds on problems involving a promise or for which the \"hard\"\ndistributions of inputs are correlated. As examples, we show how to prove a\nnearly tight bound on the bounded-error quantum communication complexity of the\ninner product function in the presence of unlimited amounts of EPR-type\nentanglement and a similarly strong bound on the complexity of the shifted\nquadratic character problem.",
    "arxiv_id": "quant-ph/0204093",
    "authors": [
      "Wim van Dam",
      "Patrick Hayden"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Renyi-entropic bounds on quantum communication",
    "url": "https://arxiv.org/abs/quant-ph/0204093"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4a3c006a-e0d8-4283-bab8-a060fe5df1bc",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}