Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control
Gap-definable counting classes
Journal of Computer and System Sciences
SIAM Journal on Computing
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Complexity theory retrospective II
Complexity limitations on Quantum computation
Journal of Computer and System Sciences
Space-bounded Quantum complexity
Journal of Computer and System Sciences
Quantum computation and quantum information
Quantum computation and quantum information
On Probabilistic Time and Space
Proceedings of the 12th 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
Classical and Quantum Computation
Classical and Quantum Computation
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Exponential separation of quantum and classical online space complexity
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Quantum computation with devices whose contents are never read
UC'10 Proceedings of the 9th international conference on Unconventional computation
Unbounded-error quantum computation with small space bounds
Information and Computation
Quantum computation with write-only memory
Natural Computing: an international journal
Inverting well conditioned matrices in quantum logspace
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.00 |
This paper studies the space-complexity of predicting the long-term behavior of a class of stochastic processes based on evolutions and measurements of quantum mechanical systems. These processes generalize a wide range of both quantum and classical space-bounded computations, including unbounded error computations given by machines having algebraic number transition amplitudes or probabilities. It is proved that any space s quantum stochastic process from this class can be simulated probabilistically with unbounded error in space O(s), and therefore deterministically in space O(s2).