{
  "annotation_id": "ae340d03-c164-4cb4-85e6-9c6c6d0c1ac2",
  "date_created": "2026-03-02T18:02:27.464000Z",
  "date_modified": "2026-03-02T18:02:27.464000Z",
  "file_hash": "855632c089590a2cbe18734973102498bfc7eb853e6924311a87cc7220a4a420",
  "private": false,
  "record": {
    "abstract": "We examine dense coding with an arbitrary pure entangled state sharing\nbetween the sender and the receiver. Upper bounds on the average success\nprobability in approximate dense coding and on the probability of conclusive\nresults in unambiguous dense coding are derived. We also construct the optimal\nprotocol which saturates the upper bound in each case.",
    "arxiv_id": "quant-ph/0604149",
    "authors": [
      "Yuan Feng",
      "Runyao Duan",
      "Zhengfeng Ji"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.74.012310",
    "journal_ref": "Phys. Rev. A 74, 012310 (2006)",
    "title": "Optimal dense coding with arbitrary pure entangled states",
    "url": "https://arxiv.org/abs/quant-ph/0604149"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e4a45fe2-95ec-4648-ae8c-30c4870244a0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}