Probabilities to accept languages by quantum finite automata

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
14 pages, to appear in COCOON'99

Keywords

Quantum Physics, Computational Complexity

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/94052

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/9904066
 http://arxiv.org/abs/quant-ph/9904066

Collections

arXiv