{
  "annotation_id": "76a261ec-0fd1-4568-8476-b10d12113a0a",
  "date_created": "2026-03-02T18:01:52.926000Z",
  "date_modified": "2026-03-02T18:01:52.926000Z",
  "file_hash": "de548c2e498afbbdf2ae9b533990dbab27fb75485266285f85928dea836e515d",
  "private": false,
  "record": {
    "abstract": "Shared entanglement is a resource available to parties communicating over a\nquantum channel, much akin to public coins in classical communication\nprotocols. Whereas shared randomness does not help in the transmission of\ninformation, or significantly reduce the classical complexity of computing\nfunctions (as compared to private-coin protocols), shared entanglement leads to\nstartling phenomena such as ``quantum teleportation\u0027\u0027 and ``superdense\ncoding.\u0027\u0027\n  The problem of characterising the power of prior entanglement has puzzled\nmany researchers. In this paper, we revisit the problem of transmitting\nclassical bits over an entanglement-assisted quantum channel. We derive a new,\noptimal bound on the number of quantum bits required for this task, for any\ngiven probability of error. All known lower bounds in the setting of bounded\nerror entanglement-assisted communication are based on sophisticated\ninformation theoretic arguments. In contrast, our result is derived from first\nprinciples, using a simple linear algebraic technique.",
    "arxiv_id": "quant-ph/0206122",
    "authors": [
      "Ashwin Nayak",
      "Julia Salzman"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "title": "On communication over an entanglement-assisted quantum channel",
    "url": "https://arxiv.org/abs/quant-ph/0206122"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ea2478d3-d5e9-43ba-be36-a5e289a3f7d9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}