one-way finite automata with quantum and classical states

ISCAS OpenIR

	one-way finite automata with quantum and classical states
	Zheng Shenggen; Qiu Daowen; Li Lvzhou; Gruska Jozef
	2012
发表期刊	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN	0302-9743
卷号	7300 LNAI 页码:273-290
摘要	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 [3]. First, we prove that coin-tossing one-way probabilistic finite automata (coin-tossing 1PFA) [23] and one-way quantum finite automata with control language (1QFACL) [6] 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 Ε 1∈>∈0, there exists a language L m that cannot be recognized by any measure-many one-way quantum finite automata (MM-1QFA) [12] with bounded error, and any 1PFA recognizing it has at last m states, but L m can be recognized by a 1QCFA for any error bound Ε∈>∈0 with O(logm) quantum states and 12 classical states. © 2012 Springer-Verlag Berlin Heidelberg.; 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 [3]. First, we prove that coin-tossing one-way probabilistic finite automata (coin-tossing 1PFA) [23] and one-way quantum finite automata with control language (1QFACL) [6] 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 Ε 1∈>∈0, there exists a language L m that cannot be recognized by any measure-many one-way quantum finite automata (MM-1QFA) [12] with bounded error, and any 1PFA recognizing it has at last m states, but L m can be recognized by a 1QCFA for any error bound Ε∈>∈0 with O(logm) quantum states and 12 classical states. © 2012 Springer-Verlag Berlin Heidelberg.
收录类别	EI
关键词	Automata Theory Computer Simulation
部门归属	(1) Department of Computer Science Sun Yat-sen University Guangzhou 510006 China; (2) Faculty of Informatics Masaryk University Brno 602 00 Czech Republic; (3) SQIG-Instituto de Telecomunicações Departamento de Matemática Instituto Superior Técnico Av. Rovisco Pais 1049-001 Lisbon Portugal; (4) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100080 China
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15022
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Zheng Shenggen,Qiu Daowen,Li Lvzhou,et al. one-way finite automata with quantum and classical states[J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),2012,7300 LNAI:273-290.
APA	Zheng Shenggen,Qiu Daowen,Li Lvzhou,&Gruska Jozef.(2012).one-way finite automata with quantum and classical states.Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),7300 LNAI,273-290.
MLA	Zheng Shenggen,et al."one-way finite automata with quantum and classical states".Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 7300 LNAI(2012):273-290.