{
  "annotation_id": "96ea23bb-5d92-43da-993a-17a8e8a32808",
  "date_created": "2026-03-02T18:02:13.805000Z",
  "date_modified": "2026-03-02T18:02:13.805000Z",
  "file_hash": "41dc9cfb382cb41c852fa4adc7f899e7a660cbfddf71585b419ac31ee6e368dc",
  "private": false,
  "record": {
    "abstract": "In this paper we give a definition for the Kolmogorov complexity of a pure\nquantum state. In classical information theory the algorithmic complexity of a\nstring is a measure of the information needed by a universal machine to\nreproduce the string itself. We define the complexity of a quantum state by\nmeans of the classical description complexity of an (abstract) experimental\nprocedure that allows us to prepare the state with a given fidelity. We argue\nthat our definition satisfies the intuitive idea of complexity as a measure of\n``how difficult\u0027\u0027 it is to prepare a state. We apply this definition to give an\nupper bound on the algorithmic complexity of a number of states.",
    "arxiv_id": "quant-ph/0412172",
    "authors": [
      "C. Mora",
      "H. J. Briegel"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Algorithmic complexity of quantum states",
    "url": "https://arxiv.org/abs/quant-ph/0412172"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "386a5645-51d7-4ec7-b9be-1feb36dd5325",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}