中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 软件研究所
  3. 软件所图书馆
  4. 期刊论文
one-way finite automata with quantum and classical states

文献类型：期刊论文

作者Zheng Shenggen ; Qiu Daowen ; Li Lvzhou ; Gruska Jozef
刊名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
出版日期2012
卷号7300 LNAI页码:273-290
关键词Automata theory Computer simulation
ISSN号0302-9743
中文摘要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
语种英语
公开日期2013-09-17
源URL[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.

入库方式： OAI收割

来源：软件研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。