On the languages accepted by finite reversible automata
14th International Colloquium on Automata, languages and programming
Quantum automata and quantum grammars
Theoretical Computer Science
Lower Space Bounds for Randomized Computation
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
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
Quantum Reversibility and a New Model of Quantum Automaton
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Space-bounded quantum computation
Space-bounded quantum computation
On the complexity of simulating space-bounded quantum computations
Computational Complexity
Theory of Computing Systems
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Computational Complexity: A Modern Approach
Computational Complexity: A Modern Approach
Superiority of exact quantum automata for promise problems
Information Processing Letters
Hi-index | 0.00 |
In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of a WOM to a (deterministic or probabilistic) classical computer brings no advantage. We demonstrate a setup where a quantum computer using a WOM can solve problems that neither a classical computer with a WOM nor a quantum computer without a WOM can solve, when all other resource bounds are equal. We also show that resource-bounded quantum reductions among computational problems are more powerful than their classical counterparts.