Size lower bounds for quantum automata

DOI10.1007/978-3-642-39074-6_4zbMATH Open1381.68079OpenAlexW112012283MaRDI QIDQ5300907FDOQ5300907

Authors: Maria Paola Bianchi, Carlo Mereghetti, Beatrice Palano 

Publication date: 28 June 2013

Published in: Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39074-6_4

Recommendations

• Size lower bounds for quantum automata
• Lower bounds on the size of semi-quantum finite automata
• scientific article; zbMATH DE number 1759400
• Lower Bounds for Generalized Quantum Finite Automata
• Lower bounds on the size of quantum automata accepting unary languages.

zbMATH Keywords

descriptional complexityquantum finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum algorithms and complexity in the theory of computing (68Q12)

Cited In (7)

• Lower bounds on the size of semi-quantum finite automata
• Size lower bounds for quantum automata
• Complexity of promise problems on classical and quantum automata
• Lower Bounds for Generalized Quantum Finite Automata
• Title not available (Why is that?)
• GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
• Title not available (Why is that?)

This page was built for publication: Size lower bounds for quantum automata

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