Languages recognized with unbounded error by quantum finite automata
Abuzer Yakaryilmaz, A. C. Cem Say
TL;DR
This paper investigates the class of languages recognized by quantum finite automata with unbounded error, exploring their computational capabilities and limitations.
Contribution
It introduces new theoretical insights into the recognition power of quantum finite automata with unbounded error, extending previous models.
Findings
Quantum finite automata recognize certain non-regular languages
Unbounded error models have greater recognition power than bounded error models
The paper establishes hierarchy results for quantum automata classes
Abstract
This paper has been superseded by arXiv:1007.3624
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Machine Learning and Algorithms