1 paper · 1 filter
A. Ambainis, R. Freivalds
We study 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an automaton is required to give the correct answer with a…