{
  "annotation_id": "91e69391-dc7f-4f2d-9b00-bec1384f1a6f",
  "date_created": "2026-03-02T18:01:45.469000Z",
  "date_modified": "2026-03-02T18:01:45.469000Z",
  "file_hash": "6d6ed09f618d5d1cf532f952912af923556167a74e67028dce1cd9a7e7f41f71",
  "private": false,
  "record": {
    "abstract": "We consider visible compression for discrete memoryless sources of mixed\nquantum states when only classical information can be sent from Alice to Bob.\nWe assume that Bob knows the source statistics, and that Alice and Bob have\nidentical random number generators. We put in an information theoretic\nframework some recent results on visible compression for sources of states with\ncommuting density operators, and remove the commutativity requirement. We\nderive a general achievable compression rate, which is for the noncommutative\ncase still higher than the known lower bound. We also present several related\nproblems of classical information theory, and show how they can be used to\nanswer some questions of the mixed state compression problem.",
    "arxiv_id": "quant-ph/0110130",
    "authors": [
      "Emina Soljanin"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Compressing Mixed-State Sources by Sending Classical Information",
    "url": "https://arxiv.org/abs/quant-ph/0110130"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0757165e-e7e1-43c7-a845-13e4167eb723",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}