{"paper":{"title":"One-way finite automata with quantum and classical states","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daowen Qiu, Jozef Gruska, Lvzhou Li, Shenggen Zheng","submitted_at":"2011-12-09T05:52:32Z","abstract_excerpt":"In this paper, we introduce and explore a new model of {\\it quantum finite automata} (QFA). Namely, {\\it one-way finite automata with quantum and classical states} (1QCFA), a one way version of {\\it two-way finite automata with quantum and classical states} (2QCFA) introduced by Ambainis and Watrous in 2002 \\cite{AJ}. First, we prove that {\\it one-way probabilistic finite automata} (1PFA) \\cite{AP} and {\\it one-way quantum finite automata with control language} (1QFACL) \\cite{ACB} as well as several other models of QFA, can be simulated by 1QCFA. Afterwards, we explore several closure properti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2022","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}