Probabilities to accept languages by quantum finite automata
<|reference_start|>Probabilities to accept languages by quantum finite automata: 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.<|reference_end|>
@article{ambainis1999probabilities,
    title={Probabilities to accept languages by quantum finite automata},
    author={Andris Ambainis, Richard Bonner, Rusins Freivalds, Arnolds Kikusts},
    journal={arXiv preprint arXiv:quant-ph/9904066},
    year={1999},
    archivePrefix={arXiv},
    eprint={quant-ph/9904066},
    primaryClass={quant-ph cs.CC}
}