Quantum Automata Theory – A Review

DOI10.1007/978-3-642-24897-9_7zbMath1350.68171MaRDI QIDQ3098037

Mika Hirvensalo

Publication date: 11 November 2011

Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_7

Mathematics Subject Classification ID

68Q45: Formal languages and automata

81P68: Quantum computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact results for accepting probabilities of quantum automata.
• Undecidable problems for probabilistic automata of fixed dimension
• Extending stochastic and quantum functions
• Quantum automata and quantum grammars
• Algebraic results on quantum automata
• Quantum computational networks
• Characterizations of 1-Way Quantum Finite Automata
• On the definition of a family of automata
• Various Aspects of Finite Quantum Automata
• NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
• Matrix Analysis
• Quantum theory, the Church–Turing principle and the universal quantum computer
• The Quantum Theory of Measurement
• On finite monoids having only trivial subgroups
• Some aspects of probabilistic automata
• Probabilistic automata
• On stochastic languages
• Logical Reversibility of Computation
• A logical calculus of the ideas immanent in nervous activity