{
  "annotation_id": "e4f0fb28-b29a-45c1-85b6-15f33e94d990",
  "date_created": "2026-03-02T18:02:02.262000Z",
  "date_modified": "2026-03-02T18:02:02.262000Z",
  "file_hash": "9606d7d48383d434e7ae8cd39d5f2430d43c681e4011fe39c7c585d5933f8620",
  "private": false,
  "record": {
    "abstract": "We consider the problem of communicating quantum states by simultaneously\nmaking use of a noiseless classical channel, a noiseless quantum channel and\nshared entanglement. We specifically study the version of the problem in which\nthe sender is given knowledge of the state to be communicated. In this setting,\na trade-off arises between the three resources, some portions of which have\nbeen investigated previously in the contexts of the quantum-classical trade-off\nin data compression, remote state preparation and superdense coding of quantum\nstates, each of which amounts to allowing just two out of these three\nresources. We present a formula for the triple resource trade-off that reduces\nits calculation to evaluating the data compression trade-off formula. In the\nprocess, we also construct protocols achieving all the optimal points. These\nturn out to be achievable by trade-off coding and suitable time-sharing between\noptimal protocols for cases involving two resources out of the three mentioned\nabove.",
    "arxiv_id": "quant-ph/0308143",
    "authors": [
      "Anura Abeyesinghe",
      "Patrick Hayden"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.68.062319",
    "journal_ref": "Phys. Rev. A 68:062319, 2003",
    "title": "Generalized remote state preparation: Trading cbits, qubits and ebits in   quantum communication",
    "url": "https://arxiv.org/abs/quant-ph/0308143"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f150ed5c-ecaa-4879-909e-abd3944176d7",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}