{
  "annotation_id": "f5c29cc4-35e5-47e0-bef9-9d184dd289b3",
  "date_created": "2026-03-02T18:02:34.530000Z",
  "date_modified": "2026-03-02T18:02:34.530000Z",
  "file_hash": "ed51ce30d7ee8ef8e603e0b99e4f3ad55a2aec042a6f5d0a01dcefc1fedfee3b",
  "private": false,
  "record": {
    "abstract": "Quantum finite automata derive their strength by exploiting interference in\ncomplex valued probability amplitudes. Of particular interest is the 2-way\nmodel of Ambainis and Watrous that has both quantum and classical states\n(2QCFA) [A. Ambainis and J. Watrous, Two-way finite automata with quantum and\nclassical state, Theoretical Computer Science, 287(1), pp. 299-311, 2002],\nsince it combines the advantage of the power of interference in a\nconstant-sized quantum system with a 2-way head.\n  This paper is a step towards finding the least powerful model which is purely\nclassical and can mimic the dynamics of quantum phase. We consider weighted\nautomata with the Cortes-Mohri definition of language recognition [C. Cortes\nand M. Mohri, Context-Free Recognition with Weighted Automata, Grammars 3(2/3),\npp. 133-150, 2000] as a candidate model for simulating 2QCFA.\n  Given any 2QCFA that (i) uses the accept-reject-continue observable, (ii)\nrecognizes a language with one-sided error and (iii) the entries of whose\nunitary matrices are algebraic complex numbers, we show a method of\nconstructing a weighted automaton over $\\mathbb{C}$ that simulates it\nefficiently.",
    "arxiv_id": "quant-ph/0701144",
    "authors": [
      "M. V. Panduranga Rao",
      "V. Vinay"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Finite Automata and Weighted Automata",
    "url": "https://arxiv.org/abs/quant-ph/0701144"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2e27aaf3-d7fe-40da-a328-dd46ab3d897d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}