Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States

DOI10.1007/978-3-540-92182-0_81zbMATH Open1183.68339OpenAlexW1552615231MaRDI QIDQ3597891FDOQ3597891

Authors: Rūsiņš Freivalds 

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_81

Recommendations

• Improved constructions of mixed state quantum automata
• Hamming, Permutations and Automata
• Improved constructions of quantum automata
• The complexity of probabilistic versus quantum finite automata
• Improved Constructions of Quantum Automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (3)

• Improved constructions of mixed state quantum automata
• Improved Constructions of Quantum Automata
• Hamming, Permutations and Automata

This page was built for publication: Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States

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