Probabilities to accept languages by quantum finite automata

Authors:
Andris Ambainis;Richard Bonner;Rusinš Freivalds;Arnolds Ķikusts
Affiliations:
Computer Science Division, University of California, Berkeley, CA;Department of Mathematics and Physics, Mälardalens University;Institute of Mathematics and Computer Science, University of Latvia, Riga, Latvia;Institute of Mathematics and Computer Science, University of Latvia, Riga, Latvia
Venue:
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Year:
1999

Citing 8
Cited 16

Time/space trade-offs for reversible computation

SIAM Journal on Computing
Quantum complexity theory

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Quantum Complexity Theory

SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Quantum automata and quantum grammars

Theoretical 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
Quantum circuit complexity

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science

One-way probabilistic reversible and quantum one-counter automata

Theoretical Computer Science
Exact Results for Accepting Probabilities of Quantum Automata

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
One-Way Probabilistic Reversible and Quantum One-Counter Automata

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Quantum Pushdown Automata

SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
Probabilistic Reversible Automata and Quantum Automata

COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Exact results for accepting probabilities of quantum automata

Theoretical Computer Science - Mathematical foundations of computer science
Quantum versus deterministic counter automata

Theoretical Computer Science
Quantum inductive inference by finite automata

Theoretical Computer Science
Various Aspects of Finite Quantum Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Mathematical logic and quantum finite state automata

Theoretical Computer Science
Postselection finite quantum automata

UC'10 Proceedings of the 9th international conference on Unconventional computation
Varieties generated by certain models of reversible finite automata

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Another approach to the equivalence of measure-many one-way quantum finite automata and its application

Journal of Computer and System Sciences
Quantum automata theory – a review

Algebraic Foundations in Computer Science
Languages recognizable by quantum finite automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.