On hybrid models of quantum finite automata

Li, L; Feng, Y

On hybrid models of quantum finite automata

Li, L Feng, Y

Permalink

Publication Type:: Journal Article
Citation:: Journal of Computer and System Sciences, 2015, 81 (7), pp. 1144 - 1158
Issue Date:: 2015-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Submitted VersionAdobe PDF (324.48 kB)

View on publisher's site

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Li, L	en_US
dc.contributor.author	Feng, Y https://orcid.org/0000-0002-3097-3896	en_US
dc.date.issued	2015-01-01	en_US
dc.identifier.citation	Journal of Computer and System Sciences, 2015, 81 (7), pp. 1144 - 1158	en_US
dc.identifier.issn	0022-0000	en_US
dc.identifier.uri	http://hdl.handle.net/10453/41867
dc.description.abstract	© 2015 Elsevier Inc. All rights reserved. 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.	en_US
dc.relation	http://purl.org/au-research/grants/arc/DP130102764
dc.relation.ispartof	Journal of Computer and System Sciences	en_US
dc.relation.isbasedon	10.1016/j.jcss.2015.01.001	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	On hybrid models of quantum finite automata	en_US
dc.type	Journal Article
utslib.citation.volume	7	en_US
utslib.citation.volume	81	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0805 Distributed Computing	en_US
utslib.for	0806 Information Systems	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	open_access
pubs.issue	7	en_US
pubs.publication-status	Published	en_US
pubs.volume	81	en_US

Abstract:

© 2015 Elsevier Inc. All rights reserved. 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/41867