{
  "annotation_id": "160a1932-4843-4bcb-a6b6-7c6c556905f5",
  "date_created": "2026-03-02T18:02:44.913000Z",
  "date_modified": "2026-03-02T18:02:44.913000Z",
  "file_hash": "16524769dfd68ebaadd9dcb36d321cb6b82019fe4487b103c99b40e74ef23227",
  "private": false,
  "record": {
    "abstract": "We construct a hierarchy of regular languages such that the current language\nin the hierarchy can be accepted by 1-way quantum finite automata with a\nprobability smaller than the corresponding probability for the preceding\nlanguage in the hierarchy. These probabilities converge to 1/2.",
    "arxiv_id": "quant-ph/9904066",
    "authors": [
      "Andris Ambainis",
      "Richard Bonner",
      "Rusins Freivalds",
      "Arnolds Kikusts"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "title": "Probabilities to accept languages by quantum finite automata",
    "url": "https://arxiv.org/abs/quant-ph/9904066"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "1b6768c6-2a11-43bd-9682-b71dae1ae400",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}