Lower Bounds for Generalized Quantum Finite Automata

DOI10.1007/978-3-540-88282-4_34zbMath1156.68459OpenAlexW1548439568MaRDI QIDQ3540128

Mark Mercer

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_34

Mathematics Subject Classification ID

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

Related Items (2)

Complexity of Promise Problems on Classical and Quantum Automata ⋮ Size lower bounds for quantum automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact results for accepting probabilities of quantum automata.
• Quantum automata and quantum grammars
• Algebraic results on quantum automata
• Characterizations of 1-Way Quantum Finite Automata
• On communication over an entanglement-assisted quantum channel
• Varieties Generated by Certain Models of Reversible Finite Automata
• Probabilistic automata
• Logical Reversibility of Computation

This page was built for publication: Lower Bounds for Generalized Quantum Finite Automata