{
  "annotation_id": "939b72d2-6387-4080-9f24-c1e25c6ee1d0",
  "date_created": "2026-03-02T18:01:42.532000Z",
  "date_modified": "2026-03-02T18:01:42.532000Z",
  "file_hash": "93ca12c5d2aab2cbf249d322141b63d1814eee75690d4546fdc6ee548bf4d113",
  "private": false,
  "record": {
    "abstract": "We introduce quantum finite state transducers (qfst), and study the class of\nrelations which they compute. It turns out that they share many features with\nprobabilistic finite state transducers, especially regarding undecidability of\nemptiness (at least for low probability of success). However, like their\n`little brothers\u0027, the quantum finite automata, the power of qfst is\nincomparable to that of their probabilistic counterpart. This we show by\ndiscussing a number of characteristic examples.",
    "arxiv_id": "quant-ph/0011052",
    "authors": [
      "R. Freivalds",
      "A. Winter"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Proc. SOFSEM 2001, pp. 233--242, Springer, Berlin 2001.",
    "title": "Quantum Finite State Transducers",
    "url": "https://arxiv.org/abs/quant-ph/0011052"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3a790e72-9a3a-415c-9730-bb1392e0c433",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}