Descriptional complexity issues in quantum computing
Journal of Automata, Languages and Combinatorics
Regular languages accepted by quantum automata
Information and Computation
Quantum automata and quantum grammars
Theoretical Computer Science
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
Probabilistic Two-Way Machines
Proceedings on 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
Characterizations of quantum automata
Theoretical Computer Science
On the power of 2-way probabilistic finite state automata
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Quantum computation with write-only memory
Natural Computing: an international journal
| Hi-index | 5.23 |
In classical computation, one only needs to sequence O(log1@e) identical copies of a given probabilistic automaton with one-sided error p0}, Kondacs and Watrous use a different probability amplification method, which yields machines with O((1@e)^2) states, and with runtime O(1@e|w|), where w is the input string. In this paper, we examine significantly more efficient techniques of probability amplification. One of our methods produces machines which decide L in O(|w|) time (i.e. the running time does not depend on the error bound) and which have O((1@e)^2^c) states for any given constant c1. Other methods, yielding machines whose state complexities are polylogarithmic in 1@e, including one which halts in o(log(1@e)|w|) time, are also presented.