Quantum versus Probabilistic One-Way Finite Automata with Counter

Authors:
Richard F. Bonner;Rusins Freivalds;Maksim Kravtsev
Affiliations:
-;-;-
Venue:
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Year:
2001

Citing 3
Cited 3

Quantum Finite One-Counter Automata

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Quantum versus Deterministic Counter Automata

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Quantum versus deterministic counter automata

Theoretical Computer Science
Quantum computation with write-only memory

Natural Computing: an international journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifically, two languages are considered, the first is not recognizable by deterministic one-counter one-way finite automata, the second is not recognizable with bounded error by probabilistic one-counter one-way finite automata, but each recognizable with bounded error by a quantum one-counter one-way finite automaton. This result contrasts the case of one-way finite automata without counter, where it is known [5] that the quantum device is actually less powerful than its classical counterpart.