{
  "annotation_id": "bde1b085-433a-4d53-848a-c2dfe2ad1519",
  "date_created": "2026-03-02T18:01:46.027000Z",
  "date_modified": "2026-03-02T18:01:46.027000Z",
  "file_hash": "319c47e192e84ecf2b38d9b6a2d110f68db1ed1d8c1ddb308fb8456abc04a6a9",
  "private": false,
  "record": {
    "abstract": "One of the properties of Kondacs-Watrous model of quantum finite automata\n(QFA) is that the probability of the correct answer for a QFA cannot be\namplified arbitrarily. In this paper, we determine the maximum probabilities\nachieved by QFAs for several languages. In particular, we show that any\nlanguage that is not recognized by an RFA (reversible finite automaton) can be\nrecognized by a QFA with probability at most 0.7726...",
    "arxiv_id": "quant-ph/0109136",
    "authors": [
      "Andris Ambainis",
      "Arnolds Kikusts"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Theoretical Computer Science, 295(2003):3-25",
    "title": "Exact results for accepting probabilities of quantum automata",
    "url": "https://arxiv.org/abs/quant-ph/0109136"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ff8c833e-6a2e-403c-a65a-d349616b0fd5",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}