Improved constructions of mixed state quantum automata

DOI10.1016/J.TCS.2009.01.028MaRDI QIDQ1017405zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds, L. Mančinska, Maris Ozols

Publication date 19 May 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.01.028

zbMATH Keywords

finite automataquantum algorithmspermutation groups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Searching and sorting (68P10) Quantum computation (81P68)

Recommendations

• Hamming, Permutations and Automata
• Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
• Improved constructions of quantum automata
• Improved Constructions of Quantum Automata
• The complexity of probabilistic versus quantum finite automata

Cites work

• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• scientific article; zbMATH DE number 1960351 (Why is no real title available?)
• scientific article; zbMATH DE number 1775384 (Why is no real title available?)
• Algebraic results on quantum automata
• Non-constructive Methods for Finite Probabilistic Automata
• Permutation groups, minimal degrees and quantum computing.

Cited in

(13)

• Hamming, Permutations and Automata
• Exponentially more concise quantum recognition of non-RMM regular languages
• Improved constructions of quantum automata
• From quantum query complexity to state complexity
• Promise problems solved by quantum and classical finite automata
• Quantum state complexity of formal languages
• Potential of quantum finite automata with exact acceptance
• scientific article; zbMATH DE number 3507976 (Why is no real title available?)
• How does adiabatic quantum computation fit into quantum automata theory?
• One-way topological automata and the tantalizing effects of their topological features
• Dense quantum coding and quantum finite automata
• Improved Constructions of Quantum Automata
• Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States

This page was built for publication: Improved constructions of mixed state quantum automata

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