Superiority of exact quantum automata for promise problems

In this note, we present an infinite family of promise problems which can be solved exactly by just tuning transition amplitudes of a two-state quantum finite automaton operating in realtime mode, whereas the size of the corresponding classical automata grows without bound. (C) 2012 Elsevier B.V. All rights reserved.