{
  "annotation_id": "bf4096fe-051e-4236-88f6-b9e8e0580541",
  "date_created": "2026-03-02T18:02:17.135000Z",
  "date_modified": "2026-03-02T18:02:17.135000Z",
  "file_hash": "4fbaaab48b34ad505a8a85596a6b48aac8c4018edb0ba2d323957180f40db2f4",
  "private": false,
  "record": {
    "abstract": "In classical information theory, entropy rate and Kolmogorov complexity per\nsymbol are related by a theorem of Brudno. In this paper, we prove a quantum\nversion of this theorem, connecting the von Neumann entropy rate and two\nnotions of quantum Kolmogorov complexity, both based on the shortest qubit\ndescriptions of qubit strings that, run by a universal quantum Turing machine,\nreproduce them as outputs.",
    "arxiv_id": "quant-ph/0506080",
    "authors": [
      "Fabio Benatti",
      "Tyll Krueger",
      "Markus Mueller",
      "Rainer Siegmund-Schultze",
      "Arleta Szkola"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math-ph",
      "math.DS",
      "math.IT",
      "math.MP"
    ],
    "doi": "10.1007/s00220-006-0027-z",
    "journal_ref": "Communications in Mathematical Physics, Vol. 265, No.2 / July\n  2006, 437-461",
    "title": "Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno\u0027s Theorem",
    "url": "https://arxiv.org/abs/quant-ph/0506080"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c334e769-0946-4c70-ba85-c8be40ee2dfe",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}