Quantum versus deterministic counter automata

Authors:
Tomohiro Yamasaki;Hirotada Kobayashi;Hiroshi Imai
Affiliations:
Department of Information Science, Graduate School of Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan;Dept. of Info. Sci., Grad. Sch. of Sci., The Univ. of Tokyo and Quantum Comptn. and Info. Project, Exploratory Res. for Adv. Technol., Japan Sci. and Technol. Agency, 5-28-3 Hongo, Bunkyo-ku, Toky ...;Quantum Comptn. and Info. Project, Exploratory Res. for Adv. Technol., Japan Sci. and Technol. Agency and Dept. of Comp. Sci., Graduate School of Information Science and Technology, The University ...
Venue:
Theoretical Computer Science
Year:
2005

Citing 18
Cited 4

Universality of a reversible two-counter machine

Theoretical Computer Science - Special issue on universal machines and computations
Undecidability on quantum finite automata

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Two-Way Counter Machines and Diophantine Equations

Journal of the ACM (JACM)
Reversible space equals deterministic space

Journal of Computer and System Sciences - Eleventh annual conference on computational learning theory&slash;Twelfth Annual IEEE conference on computational complexity
Quantum automata and quantum grammars

Theoretical Computer Science
Dense quantum coding and quantum finite automata

Journal of the ACM (JACM)
Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing
Two-way finite automata with quantum and classical states

Theoretical Computer Science - Natural computing
One-way probabilistic reversible and quantum one-counter automata

Theoretical Computer Science
Quantum Finite Multitape Automata

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
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
Quantum versus Probabilistic One-Way Finite Automata with Counter

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Quantum Finite State Transducers

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Exact results for accepting probabilities of quantum automata

Theoretical Computer Science - Mathematical foundations of computer science
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
Optimal Lower Bounds for Quantum Automata and Random Access Codes

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Probabilities to accept languages by quantum finite automata

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Exact Quantum Algorithms for the Leader Election Problem

ACM Transactions on Computation Theory (TOCT)
Quantum computation with write-only memory

Natural Computing: an international journal
One-Way reversible and quantum finite automata with advice

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Bounded counter languages

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper focuses on quantum analogues of various models of counter automata, and almost completely proves the relation between the classes of languages recognizable by bounded error quantum ones and classical deterministic ones in every model of counter automata. It is proved that (i) there are languages that can be recognized by two-way quantum one-counter automata with bounded error, but cannot be recognized by two-way deterministic one-counter automata, (ii) under some reasonable restriction, every language that can be recognized by two-way deterministic one-counter automata can also be recognized by two-way reversible one-counter automata (and hence by bounded error two-way quantum one-counter automata), and (iii) for any fixed k, quantum ones and deterministic ones are incomparable in one-way k-counter automata.