Undecidability on quantum finite automata

DOI10.1145/301250.301344zbMath1346.68090OpenAlexW2063628628MaRDI QIDQ2819568

Masami Amano, Kazuo Iwama

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301344

Mathematics Subject Classification ID

Related Items (14)

Classical and Quantum Counter Automata on Promise Problems ⋮ Quaternionic quantum automata ⋮ Another approach to the equivalence of measure-many one-way quantum finite automata and its application ⋮ Unbounded-error quantum computation with small space bounds ⋮ Hierarchy and equivalence of multi-letter quantum finite automata ⋮ Quantum versus deterministic counter automata ⋮ Determining the equivalence for one-way quantum finite automata ⋮ An application of quantum finite automata to interactive proof systems ⋮ On the power of two-way multihead quantum finite automata ⋮ On Models of a Nondeterministic Computation ⋮ Languages Recognized with Unbounded Error by Quantum Finite Automata ⋮ A note on quantum sequential machines ⋮ Characterizations of one-way general quantum finite automata ⋮ On hybrid models of quantum finite automata

This page was built for publication: Undecidability on quantum finite automata