Probabilistic and quantum finite automata with postselection
Computational Complexity
2011-02-04 v1 Quantum Physics
Abstract
We prove that endowing a real-time probabilistic or quantum computer with the ability of postselection increases its computational power. For this purpose, we provide a new model of finite automata with postselection, and compare it with the model of L\={a}ce et al. We examine the related language classes, and also establish separations between the classical and quantum versions, and between the zero-error vs. bounded-error modes of recognition in this model.
Cite
@article{arxiv.1102.0666,
title = {Probabilistic and quantum finite automata with postselection},
author = {Abuzer Yakaryilmaz and A. C. Cem Say},
journal= {arXiv preprint arXiv:1102.0666},
year = {2011}
}
Comments
24 pages. A preliminary version of this paper appeared in the Proceedings of Randomized and Quantum Computation (satellite workshop of MFCS and CSL 2010), pages 14--24, 2010