中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件所图书馆  > 期刊论文
Title:
one-way finite automata with quantum and classical states
Author: Zheng Shenggen ; Qiu Daowen ; Li Lvzhou ; Gruska Jozef
Keyword: Automata theory ; Computer simulation
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Issued Date: 2012
Volume: 7300 LNAI, Pages:273-290
Indexed Type: EI
Department: (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
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 [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.
English 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 [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.
Language: 英语
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/15022
Appears in Collections:软件所图书馆_期刊论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
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-01-01,7300 LNAI:273-290.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Zheng Shenggen]'s Articles
[Qiu Daowen]'s Articles
[Li Lvzhou]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Zheng Shenggen]‘s Articles
[Qiu Daowen]‘s Articles
[Li Lvzhou]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2019  中国科学院软件研究所 - Feedback
Powered by CSpace