Space and reversal complexity of probabilistic one-way Turing machines
Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
A time complexity gap for two-way probabilistic finite-state automata
SIAM Journal on Computing
A lower bound for the nondeterministic space complexity of context-free recognition
Information Processing Letters
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
SIAM Journal on Computing
Information Processing Letters
Space-bounded Quantum complexity
Journal of Computer and System Sciences
Quantum computation and quantum information
Quantum computation and quantum information
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
Lower Space Bounds for Randomized Computation
ICALP '94 Proceedings of the 21st International Colloquium on Automata, Languages and Programming
Randomization and Derandomization in Space-Bounded Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Parallel real-time complexity theory
Parallel real-time complexity theory
On the complexity of simulating space-bounded quantum computations
Computational Complexity
Decidable and Undecidable Problems about Quantum Automata
SIAM Journal on Computing
Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines
SIAM Journal on Computing
Theory of Computing Systems
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A new family of nonstochastic languages
Information Processing Letters
Postselection finite quantum automata
UC'10 Proceedings of the 9th international conference on Unconventional computation
Unbounded-error quantum computation with small space bounds
Information and Computation
Languages recognized by nondeterministic quantum finite automata
Quantum Information & Computation
Hi-index | 0.00 |
It is a widely believed, though unproven, conjecture that the capability of postselection increases the language recognition power of both probabilistic and quantum polynomial-time computers. It is also unknown whether polynomial-time quantum machines with postselection are more powerful than their probabilistic counterparts with the same resource restrictions. We approach these problems by imposing additional constraints on the resources to be used by the computer, and are able to prove for the first time that postselection does augment the computational power of both classical and quantum computers, and that quantum does outperform probabilistic in this context, under simultaneous time and space bounds in a certain range. We also look at postselected versions of space-bounded classes, as well as those corresponding to error-free and one-sided error recognition, and provide classical characterizations. It is shown that NL would equal RL if the randomized machines had the postselection capability.