Superiority of one-way and realtime quantum machines

DOI10.1051/ITA/2012018MaRDI QIDQ4649459zbMATH OpenOpenAlexFDO

Authors Abuzer Yakaryılmaz

Publication date 22 November 2012

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2012__46_4_615_0/

zbMATH Keywords

quantum automatanondeterminismquantum computationbounded errormultihead finite automatablind counter automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Quantum counter automata
• scientific article; zbMATH DE number 2090014
• scientific article; zbMATH DE number 2080917
• Quantum versus deterministic counter automata

Cited in

(11)

• Quantum alternation
• Exact affine counter automata
• Exact Affine Counter Automata
• New results on vector and homing vector automata
• Uncountable classical and quantum complexity classes
• Quantum pushdown automata with garbage tape
• Computing and Combinatorics
• Quantum counter automata
• New results on the minimum amount of useful space
• scientific article; zbMATH DE number 1848278 (Why is no real title available?)
• Quantum \(\omega\)-automata over infinite words and their relationships

This page was built for publication: Superiority of one-way and realtime quantum machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649459)