Lower Bounds for Generalized Quantum Finite Automata

DOI10.1007/978-3-540-88282-4_34zbMATH Open1156.68459OpenAlexW1548439568MaRDI QIDQ3540128FDOQ3540128

Authors: 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

Recommendations

• Lower bounds on the size of semi-quantum finite automata
• Size lower bounds for quantum automata
• Size lower bounds for quantum automata
• scientific article; zbMATH DE number 1759400
• Lower bounds on the size of quantum automata accepting unary languages.
• Quantum finite automata
• SOFSEM 2006: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 2044497
• Various Aspects of Finite Quantum Automata
• Quantum finite automata and weighted automata

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Probabilistic automata
• Title not available (Why is that?)
• Logical Reversibility of Computation
• Quantum automata and quantum grammars
• Algebraic results on quantum automata
• Characterizations of 1-Way Quantum Finite Automata
• Exact results for accepting probabilities of quantum automata.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On communication over an entanglement-assisted quantum channel
• Varieties Generated by Certain Models of Reversible Finite Automata

Cited In (5)

• Size lower bounds for quantum automata
• Complexity of promise problems on classical and quantum automata
• Size lower bounds for quantum automata
• GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
• Title not available (Why is that?)

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

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