Probabilistic and quantum finite automata with postselection
arXiv:1102.0666
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ā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.
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