{
  "annotation_id": "c95350a4-3efa-4aec-8c41-2b18aeeee7e9",
  "date_created": "2026-03-02T18:01:42.318000Z",
  "date_modified": "2026-03-02T18:01:42.318000Z",
  "file_hash": "273393cafdfa5b7e254ea58d082ae3215144158b2d83faee2b6cad3d3e404b6f",
  "private": false,
  "record": {
    "abstract": "Quantum finite automata, as well as quantum pushdown automata (QPA) were\nfirst introduced by C. Moore and J. P. Crutchfield. In this paper we introduce\nthe notion of QPA in a non-equivalent way, including unitarity criteria, by\nusing the definition of quantum finite automata of Kondacs and Watrous. It is\nestablished that the unitarity criteria of QPA are not equivalent to the\ncorresponding unitarity criteria of quantum Turing machines. We show that QPA\ncan recognize every regular language. Finally we present some simple languages\nrecognized by QPA, not recognizable by deterministic pushdown automata.",
    "arxiv_id": "quant-ph/0102054",
    "authors": [
      "Marats Golovkins"
    ],
    "categories": [
      "quant-ph",
      "cs.CC",
      "cs.FL"
    ],
    "journal_ref": "LNCS, 2000, vol. 1963, pp. 336-346",
    "title": "Quantum Pushdown Automata",
    "url": "https://arxiv.org/abs/quant-ph/0102054"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b122a02f-00a0-401d-9faf-a59e3377c0cf",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}