A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Descriptional complexity issues in quantum computing
Journal of Automata, Languages and Combinatorics
Two-way automata simulations and unary languages
Journal of Automata, Languages and Combinatorics
Quorums from difference covers
Information Processing Letters
Quantum automata and quantum grammars
Theoretical Computer Science
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
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
Characterizations of 1-Way Quantum Finite Automata
Characterizations of 1-Way Quantum Finite Automata
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We show that, for any stochastic event p of period n, there exists a measure-once one-way quantum finite automaton (1qfa) with at most 2驴6n + 25 states inducing the event ap + b, for constants a 0, b驴0, satisfying a+b 驴 1. This fact is proved by designing an algorithm which constructs the desired 1qfa in polynomial time. As a consequence, we get that any periodic language of period n can be accepted with isolated cut point by a 1qfa with no more than 2驴6n+26 states. Our results give added evidence of the strength of measure-once 1qfa's with respect to classical automata.