Quantcast

Unary probabilistic and quantum automata on promise problems

Research paper by Aida Gainutdinova, Abuzer Yakaryılmaz

Indexed on: 27 Dec '17Published on: 26 Dec '17Published in: Quantum Information Processing



Abstract

We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error unary QFAs are more powerful than bounded-error unary PFAs, and, contrary to the binary language case, the computational power of Las-Vegas QFAs and bounded-error PFAs is equivalent to the computational power of deterministic finite automata (DFAs). Then, we present a new family of unary promise problems defined with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.