Time-Space Efficient Simulations of Quantum Computations

We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the other by quantum computations that use an arbitrary fixed universal set of gates. Specifically, our simulations show that every language solvable by a bounded-error quantum algorithm running in time t and space s is also solvable by an unbounded-error randomized algorithm running in time O(t

• Type: Journal
• Year: 2010
• Where: ECCC
• Authors: Dieter van Melkebeek, Thomas Watson
• Keywords: Bounded-error Quantum Algorithm, Computation, ECCC 2010, Quantum