Lower bounds on the size of quantum automata accepting unary languages.

DOI10.1007/B13810zbMATH Open1257.68096OpenAlexW3144329707MaRDI QIDQ5897352FDOQ5897352

Beatrice Palano, Alberto Bertoni, Carlo Mereghetti

Publication date: 23 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13810

Recommendations

• scientific article; zbMATH DE number 1759400
• scientific article; zbMATH DE number 2044497
• On the Size of One-way Quantum Finite Automata with Periodic Behaviors
• Small size quantum automata recognizing some regular languages
• Quantum automata for some multiperiodic languages

zbMATH Keywords

quantum automataquantum information theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cited In (14)

• Some algebraic properties of measure-once two-way quantum finite automata
• On the Size of One-way Quantum Finite Automata with Periodic Behaviors
• Title not available (Why is that?)
• Developments in Language Theory
• Quantum automata for some multiperiodic languages
• Small size quantum automata recognizing some regular languages
• Some formal tools for analyzing quantum automata.
• Lower Bounds for Generalized Quantum Finite Automata
• Quantum bounds for 2D-grid and Dyck language
• Title not available (Why is that?)
• Quantum finite automata: advances on Bertoni's ideas
• Preface
• Title not available (Why is that?)
• Languages Recognized with Unbounded Error by Quantum Finite Automata

This page was built for publication: Lower bounds on the size of quantum automata accepting unary languages.

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