We use tools from the algebraic theory of automata to investigate the class of languages recognized by two models of Quantum Finite Automata (QFA): Brodsky and Pippenger's end-decisive model, and a new QFA model whose definition is motivated by implementations of quantum computers using nucleo-magnetic resonance (NMR). In particular, we are interested in the new model since nucleo-magnetic resonance was used to construct the most powerful physical quantum machine to date. We give a complete characterization of the languages recognized by the new model and by Boolean combinations of the Brodsky-Pippenger model. Our results show a striking similarity in the class of languages recognized by the end-decisive QFAs and the new model, even though these machines are very different on the surface. © Springer-Verlag 2004.
CITATION STYLE
Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., & Thérien, D. (2004). Algebraic results on quantum automata. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2996, 93–104. https://doi.org/10.1007/978-3-540-24749-4_9
Mendeley helps you to discover research relevant for your work.