We present a simple construction of quantum automata which achieve an exponential advantage over classical finite automata. Our automata use states to recognize a language that requires p states classically. The construction is both substantially simpler and achieves a better constant in the front of logp than the previously known construction of [2]. Similarly to [2], our construction is by a probabilistic argument. We consider the possibility to derandomize it and present some preliminary results in this direction. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Ambainis, A., & Nahimovs, N. (2008). Improved constructions of quantum automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5106 LNCS, pp. 47–56). Springer Verlag. https://doi.org/10.1007/978-3-540-89304-2_5
Mendeley helps you to discover research relevant for your work.