One-way finite automata with quantum and classical states

D 2012

One-way finite automata with quantum and classical states

GRUSKA, Jozef; Shenggen ZHENG; Daowen QIU a Lvzhou LI

Základní údaje

Originální název

One-way finite automata with quantum and classical states

Název česky

Jednosměrné konečné automaty s kvantovými a klasickými stavy

Autoři

GRUSKA, Jozef; Shenggen ZHENG; Daowen QIU a Lvzhou LI

Vydání

Německo, Languages Alive Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday, od s. 273-290, 18 s. 2012

Nakladatel

Springer-Verlag

Další údaje

Jazyk

angličtina

Typ výsledku

Stať ve sborníku

Obor

10201 Computer sciences, information science, bioinformatics

Stát vydavatele

Německo

Utajení

není předmětem státního či obchodního tajemství

Forma vydání

tištěná verze "print"

Impakt faktor

Impact factor: 0.402 v roce 2005

Označené pro přenos do RIV

Ano

Kód RIV

RIV/00216224:14330/12:00059150

Organizační jednotka

Fakulta informatiky

ISBN

978-3-642-31643-2

ISSN

DOI

https://doi.org/10.1007/978-3-642-31644-9_19

Klíčová slova česky

Jednosměrné konečné automaty

Klíčová slova anglicky

One-way finite automata

Příznaky

Mezinárodní význam, Recenzováno

Změněno: 23. 4. 2013 13:16, RNDr. Pavel Šmerk, Ph.D.

Anotace

ORIG CZ

V originále

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. First, we prove that one-way probabilistic finite automata (1PFA) and one-way quantum finite automata with control language (1QFACL), 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 \epsilon_{1} > 0, there exists a language L_{m} that cannot be recognized by any measure-many one-way quantum finite automata (MM-1QFA) with bounded error 7/9+\epsilon_{1}, and any 1PFA recognizing it has at last m states, but L_{m} can be recognized by a 1QCFA for any error bound \epsilon > 0 with O(log(m)$ quantum states and 12 classical states.

Česky

V článku je zaveden a prozkoumán nový model kvantových konečných automatů.

Návaznosti

MSM0021622419, záměr

Název: Vysoce paralelní a distribuované výpočetní systémy

Investor: Ministerstvo školství, mládeže a tělovýchovy ČR, Vysoce paralelní a distribuované výpočetní systémy

Citovat

GRUSKA, Jozef; Shenggen ZHENG; Daowen QIU a Lvzhou LI. One-way finite automata with quantum and classical states. In Bordihn Henning; Kutrib Martin; Truthe Bianca. Languages Alive Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday. Německo: Springer-Verlag, 2012, s. 273-290. ISBN 978-3-642-31643-2. Dostupné z: https://doi.org/10.1007/978-3-642-31644-9_19.

@inproceedings{961198,
   author = {Gruska, Jozef and Zheng, Shenggen and Qiu, Daowen and Li, Lvzhou},
   address = {Německo},
   booktitle = {Languages Alive Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday},
   doi = {https://doi.org/10.1007/978-3-642-31644-9_19},
   editor = {Bordihn Henning; Kutrib Martin; Truthe Bianca},
   keywords = {One-way finite automata},
   howpublished = {tištěná verze "print"},
   language = {eng},
   location = {Německo},
   isbn = {978-3-642-31643-2},
   pages = {273-290},
   publisher = {Springer-Verlag},
   title = {One-way finite automata with quantum and classical states},
   year = {2012}
}

TY  - CONF
ID  - 961198
AU  - Gruska, Jozef - Zheng, Shenggen - Qiu, Daowen - Li, Lvzhou
PY  - 2012
TI  - One-way finite automata with quantum and classical states
PB  - Springer-Verlag
CY  - Německo
SN  - 9783642316432
KW  - One-way finite automata
N2  - 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. First, we prove that one-way probabilistic finite automata (1PFA) and one-way quantum finite automata with control language (1QFACL), 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 \epsilon_{1} > 0, there exists a language L_{m} that cannot be recognized by any measure-many one-way quantum finite automata (MM-1QFA) with bounded error 7/9+\epsilon_{1}, and any 1PFA recognizing it has at last m states, but L_{m} can be recognized by a 1QCFA for any error bound \epsilon > 0 with O(log(m)$ quantum states and 12 classical states.
ER  -

GRUSKA, Jozef; Shenggen ZHENG; Daowen QIU a Lvzhou LI. One-way finite automata with quantum and classical states. In Bordihn Henning; Kutrib Martin; Truthe Bianca. \textit{Languages Alive Essays Dedicated to Jürgen Dassow on the Occasion of His 65th Birthday}. Německo: Springer-Verlag, 2012, s.~273-290. ISBN~978-3-642-31643-2. Dostupné z: https://doi.org/10.1007/978-3-642-31644-9\_{}19.

Přehled o publikaci