{
  "annotation_id": "c8fa67b7-462d-4b41-a2d5-f26fd7e170c2",
  "date_created": "2026-03-02T18:02:37.839000Z",
  "date_modified": "2026-03-02T18:02:37.839000Z",
  "file_hash": "c4729d4525fdea35d1414fbff4aead2666c01fee95788174d3a99ca13768bb50",
  "private": false,
  "record": {
    "abstract": "We investigate the question of whether or not there exists a noncommutative/\nquantum extension of a recent (commutative probabilistic) result of Clarke and\nBarron. They demonstrated that the Jeffreys\u0027 invariant prior of Bayesian theory\nyields the common asymptotic (minimax and maximin) redundancy - the excess of\nthe encoding cost over the source entropy - of universal data compression in a\nparametric setting. We study certain probability distributions for the\ntwo-level quantum systems. We are able to compute exact formulas for the\ncorresponding redundancies, for which we find the asymptotic limits. These\nresults are very suggestive and do indeed point towards a possible quantum\nextension of the result of Clarke and Barron.",
    "arxiv_id": "quant-ph/9612043",
    "authors": [
      "Christian Krattenthaler",
      "Paul Slater"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "IEEE Trans.Info.Theor. 46 (2000) 801-819",
    "title": "Asymptotic Redundancies for Universal Quantum Coding",
    "url": "https://arxiv.org/abs/quant-ph/9612043"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d09980f9-bca1-4826-af02-98baf7bb6388",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}