Probabilities to accept languages by quantum finite automata
classification
🪐 quant-ph
cs.CC
keywords
hierarchyautomatafinitelanguagelanguagesprobabilitiesprobabilityquantum
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.