Unary probabilistic and quantum automata on promise problems
Computational Complexity
2015-03-12 v2 Formal Languages and Automata Theory
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 QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems 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.
Keywords
Cite
@article{arxiv.1502.01462,
title = {Unary probabilistic and quantum automata on promise problems},
author = {Aida Gainutdinova and Abuzer Yakaryilmaz},
journal= {arXiv preprint arXiv:1502.01462},
year = {2015}
}
Comments
Minor corrections