On hybrid models of quantum finite automata

被引:11
作者
Li, Lvzhou [1 ,2 ]
Feng, Yuan [2 ,3 ]
机构
[1] Sun Yat Sen Univ, Dept Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
[2] Univ Technol Sydney, FEIT, Ctr Quantum Computat & Intelligent Syst, Sydney, NSW 2007, Australia
[3] Chinese Acad Sci, AMSS UTS Joint Res Lab Quantum Computat, Beijing, Peoples R China
基金
澳大利亚研究理事会; 中国国家自然科学基金;
关键词
Quantum computing; Automata theory; Quantum finite automata; Hybrid model of QFA; EQUIVALENCE; COMPLEXITY;
D O I
10.1016/j.jcss.2015.01.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In the literature, there exist several interesting hybrid models of quantum finite automata (QFA) which have both quantum and classical states. This paper describes these models in a uniform way: a hybrid QFA can be seen as a two-component communication system consisting of a quantum component and a classical one, and the existing hybrid QFA differ from each other mainly in the specific communication pattern: classical-quantum, or quantum-classical, or two-way. We clarify the relationship between these hybrid QFA and some other models; in particular, it is shown that hybrid QFA can be simulated exactly by QFA with general quantum operations. As corollaries, some results in the literature concerning the language recognition power and the equivalence problem of hybrid QFA follow directly from these relationships clarified in this paper. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:1144 / 1158
页数:15
相关论文
共 33 条
[1]  
Amano M., 1999, Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, P368, DOI 10.1145/301250.301344
[2]   1-way quantum finite automata: strengths, weaknesses and generalizations [J].
Ambainis, A ;
Freivalds, R .
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1998, :332-341
[3]   Dense quantum coding and quantum finite automata [J].
Ambainis, A ;
Nayak, A ;
Ta-Shma, A ;
Vazirani, U .
JOURNAL OF THE ACM, 2002, 49 (04) :496-511
[4]   Two-way finite automata with quantum and classical states [J].
Ambainis, A ;
Watrous, J .
THEORETICAL COMPUTER SCIENCE, 2002, 287 (01) :299-311
[5]  
[Anonymous], 2000, Technical report
[6]  
[Anonymous], ARXIV14027254
[7]  
Bertoni A, 2003, LECT NOTES COMPUT SC, V2710, P1
[8]   Regular languages accepted by quantum automata [J].
Bertoni, A ;
Carpentieri, M .
INFORMATION AND COMPUTATION, 2001, 165 (02) :174-182
[9]   Characterizations of 1-way quantum finite automata [J].
Brodsky, A ;
Pippenger, N .
SIAM JOURNAL ON COMPUTING, 2002, 31 (05) :1456-1478
[10]   Consequences and limits of nonlocal strategies [J].
Cleve, R ;
Hoyer, P ;
Toner, B ;
Watrous, J .
19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, :236-249