{
  "annotation_id": "94e8ffd3-3efc-41dd-a325-f519cea6485d",
  "date_created": "2026-03-02T18:01:52.431000Z",
  "date_modified": "2026-03-02T18:01:52.431000Z",
  "file_hash": "7cca744b1882160a3c68a8274df683242a861792df1217368525d3ce1c44b2ad",
  "private": false,
  "record": {
    "abstract": "We simply construct a quantum universal variable-length source code in which,\nindependent of information source, both of the average error and the\nprobability that the coding rate is greater than the entropy rate $H(rho_p)$,\ntend to 0. If $H(rho_p)$ is estimated, we can compress the coding rate to the\nadmissible rate $H(rho_p)$ with a probability close to 1. However, when we\nperform a naive measurement for the estimation of $H(rho_p)$, the input state\nis demolished. By smearing the measurement, we successfully treat the trade-off\nbetween the estimation of $H(rho_p)$ and the non-demolition of the input state.\nOur protocol can be used not only for the Schumacher\u0027s scheme but also for the\ncompression of entangled states.",
    "arxiv_id": "quant-ph/0209124",
    "authors": [
      "Masahito Hayashi",
      "Keiji Matsumoto"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Quantum Information and Computation, Vol.2, Special Issue,\n  pp.519-529 (2002).",
    "title": "Simple construction of quantum universal variable-length source coding",
    "url": "https://arxiv.org/abs/quant-ph/0209124"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "01961e85-6b12-4192-a377-41636e95690f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}