Quantum finite multitape automata

DOI10.1007/3-540-47849-3_21MaRDI QIDQ4496246zbMATH OpenFDO

Authors Marats Golovkins, Andris Ambainis, Richard F. Bonner, Rūsiņš Freivalds, Marek Karpinski

Publication date 13 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/quant-ph/9905026

zbMATH Keywords

quantum finite automataquantum finite multitape automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Succinctness of two-way probabilistic and quantum finite automata
• Languages Recognized with Unbounded Error by Quantum Finite Automata
• scientific article; zbMATH DE number 1512863
• Implementation and Application of Automata
• The complexity of probabilistic versus quantum finite automata

Cited in

(13)

• Quantum versus deterministic counter automata
• Local transition functions of quantum Turing machines
• Quantum finite automata: a modern introduction
• Postselection finite quantum automata
• scientific article; zbMATH DE number 2079870 (Why is no real title available?)
• scientific article; zbMATH DE number 2080922 (Why is no real title available?)
• scientific article; zbMATH DE number 7204467 (Why is no real title available?)
• Quantum finite automata: advances on Bertoni's ideas
• On the power of two-way multihead quantum finite automata
• scientific article; zbMATH DE number 7104930 (Why is no real title available?)
• scientific article; zbMATH DE number 6440119 (Why is no real title available?)
• Multi-letter Reversible and Quantum Finite Automata
• Quantum inductive inference by finite automata

This page was built for publication: Quantum finite multitape automata

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