>So far (AFAIU) anything that can be simulated on a qc can also be simulated (much more easily) on a classical computer. A few things about this idea. 1. It r

>So far (AFAIU) anything that can be simulated on a qc can also be simulated (much more easily) on a classical computer. A few things about this idea. 1. It really depends on what you mean by "more easily." From a technical perspective, yes, simulating this on a classical computer is much easier. But simulating this on a quantum computer gives an exponential speed up, presuming you can live with the provisos associated with such a simulation. 2. Suppose our _model_ of quantum mechanics itself is wrong. For example, suppose we live in a universe where some peculiar physical collapse theory obtains (it would have to be peculiar indeed given the constraints we have on such a thing, but presume anyway, for the sake of argument). Then the quantum simulation may indeed tell us something that we don't know. If you've read Aaronson's book, he sort of suggests this is one of the cool things about Quantum Computing: it operates as an experimental domain within which some pretty strict limits on our quantum theory can be tested. Eg, if we did discover that there is a physical collapse of some kind, then one way that might happen is with a non-linearity in the Schrodinger Equation. But if there is such a non-linearity than it has some pretty profound (one might even say absurd) implications for what you can get away with with a quantum computer.