Probabilities to accept languages by quantum finite automata
Quantum Physics
2007-05-23 v1 Computational Complexity
Abstract
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.
Cite
@article{arxiv.quant-ph/9904066,
title = {Probabilities to accept languages by quantum finite automata},
author = {Andris Ambainis and Richard Bonner and Rusins Freivalds and Arnolds Kikusts},
journal= {arXiv preprint arXiv:quant-ph/9904066},
year = {2007}
}
Comments
14 pages, to appear in COCOON'99