On the complexity of simulating space-bounded quantum computations
- 86 Downloads
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).
Keywords.Space-bounded quantum computation quantum computational complexity space-bounded computation
Mathematics Subject Classification (2000).03D15 68Q15
Unable to display preview. Download preview PDF.