Decidable and Undecidable Problems about Quantum Automata
From MaRDI portal
Publication:5317206
DOI10.1137/S0097539703425861zbMath1078.81012arXivquant-ph/0304082OpenAlexW2037418280MaRDI QIDQ5317206
Blondel, Vincent D., Emmanuel Jeandel, Natacha Portier, Pascal Koiran
Publication date: 16 September 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0304082
Related Items (21)
Reachability analysis of quantum Markov decision processes ⋮ Unnamed Item ⋮ The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete ⋮ An optimal quantum error-correcting procedure using quantifier elimination ⋮ Quantum automata and algebraic groups ⋮ On injectivity of quantum finite automata ⋮ Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\) ⋮ Quantum finite automata: advances on Bertoni's ideas ⋮ Reachability problems in quaternion matrix and rotation semigroups ⋮ Quantum computation with write-only memory ⋮ Unbounded-error quantum computation with small space bounds ⋮ Some formal tools for analyzing quantum automata. ⋮ ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS ⋮ Determining the equivalence for one-way quantum finite automata ⋮ Unnamed Item ⋮ On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond ⋮ On Reachability Problems for Low-Dimensional Matrix Semigroups ⋮ On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond ⋮ Acceptance Ambiguity for Quantum Automata ⋮ A note on quantum sequential machines ⋮ ON THE DECIDABILITY OF THE INTERSECTION PROBLEM FOR QUANTUM AUTOMATA AND CONTEXT-FREE LANGUAGES
This page was built for publication: Decidable and Undecidable Problems about Quantum Automata
