{
  "annotation_id": "6542c8f9-4b56-486e-ab2a-538697d7dd7a",
  "date_created": "2026-03-02T18:02:37.186000Z",
  "date_modified": "2026-03-02T18:02:37.186000Z",
  "file_hash": "8ecede9a95445e3e77eb812741c3faa8807d8796b852118a7aa28291302d7a01",
  "private": false,
  "record": {
    "abstract": "Does the notion of a quantum randomized or nondeterministic algorithm make\nsense, and if so, does quantum randomness or nondeterminism add power? Although\nreasonable quantum random sources do not add computational power, the\ndiscussion of quantum randomness naturally leads to several definitions of the\ncomplexity of quantum states. Unlike classical string complexity, both\ndeterministic and nondeterministic quantum state complexities are interesting.\nA notion of \\emph{total quantum nondeterminism} is introduced for decision\nproblems. This notion may be a proper extension of classical nondeterminism.",
    "arxiv_id": "quant-ph/9610012",
    "authors": [
      "E. Knill"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Randomness and Nondeterminism",
    "url": "https://arxiv.org/abs/quant-ph/9610012"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "39156dbe-0bad-431a-80cf-7f5b5378fe3a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}