{
  "annotation_id": "b9bdb369-1d4d-4195-be89-836c08318531",
  "date_created": "2026-03-02T18:02:24.018000Z",
  "date_modified": "2026-03-02T18:02:24.018000Z",
  "file_hash": "6a7c45b0e5f904134f1e476a700e857adf37a64da1de654ea00935dbd393f300",
  "private": false,
  "record": {
    "abstract": "We consider quantum channels with one sender and two receivers, used in\nseveral different ways for the simultaneous transmission of independent\nmessages. We begin by extending the technique of superposition coding to\nquantum channels with a classical input to give a general achievable region. We\nalso give outer bounds to the capacity regions for various special cases from\nthe classical literature and prove that superposition coding is optimal for a\nclass of channels. We then consider extensions of superposition coding for\nchannels with a quantum input, where some of the messages transmitted are\nquantum instead of classical, in the sense that the parties establish bipartite\nor tripartite GHZ entanglement. We conclude by using state merging to give\nachievable rates for establishing bipartite entanglement between different\npairs of parties with the assistance of free classical communication.",
    "arxiv_id": "quant-ph/0603098",
    "authors": [
      "Jon Yard",
      "Patrick Hayden",
      "Igor Devetak"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math.IT"
    ],
    "doi": "10.1109/TIT.2011.2165811",
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Quantum broadcast channels",
    "url": "https://arxiv.org/abs/quant-ph/0603098"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7d61c22a-6a1f-4ef3-a3bd-b8d037b7b3b3",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}