GRUSKA, Jozef, Shenggen ZHENG, Daowen QIU and Lvzhou LI. One-way finite automata with quantum and classical states. In Bordihn Henning; Kutrib Martin; Truthe Bianca. Languages Alive Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Německo: Springer-Verlag, 2012, p. 273-290. ISBN 978-3-642-31643-2. Available from: https://dx.doi.org/10.1007/978-3-642-31644-9_19.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name One-way finite automata with quantum and classical states
Name in Czech Jednosměrné konečné automaty s kvantovými a klasickými stavy
Authors GRUSKA, Jozef (703 Slovakia, guarantor, belonging to the institution), Shenggen ZHENG (156 China), Daowen QIU (156 China) and Lvzhou LI (156 China).
Edition Německo, Languages Alive Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday, p. 273-290, 18 pp. 2012.
Publisher Springer-Verlag
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Germany
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/12:00059150
Organization unit Faculty of Informatics
ISBN 978-3-642-31643-2
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-642-31644-9_19
Keywords (in Czech) Jednosměrné konečné automaty
Keywords in English One-way finite automata
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 23/4/2013 13:16.
Abstract
In this paper, we introduce and explore a new model of quantum finite automata (QFA). Namely, one-way finite automata with quantum and classical states (1QCFA), a one way version of two-way finite automata with quantum and classical states (2QCFA) introduced by Ambainis and Watrous in 2002. First, we prove that one-way probabilistic finite automata (1PFA) and one-way quantum finite automata with control language (1QFACL), as well as several other models of QFA, can be simulated by 1QCFA. Afterwards, we explore several closure properties for the family of languages accepted by 1QCFA. Finally, the state complexity of 1QCFA is explored and the main succinctness result is derived. Namely, for any prime m and any \epsilon_{1} > 0, there exists a language L_{m} that cannot be recognized by any measure-many one-way quantum finite automata (MM-1QFA) with bounded error 7/9+\epsilon_{1}, and any 1PFA recognizing it has at last m states, but L_{m} can be recognized by a 1QCFA for any error bound \epsilon > 0 with O(log(m)$ quantum states and 12 classical states.
Abstract (in Czech)
V článku je zaveden a prozkoumán nový model kvantových konečných automatů.
Links
MSM0021622419, plan (intention)Name: Vysoce paralelní a distribuované výpočetní systémy
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems
PrintDisplayed: 21/5/2024 02:41