Abstract
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(s 2).
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Watrous, J. On the complexity of simulating space-bounded quantum computations. comput. complex. 12, 48–84 (2003). https://doi.org/10.1007/s00037-003-0177-8
Received:
Issue Date:
DOI: https://doi.org/10.1007/s00037-003-0177-8