Earlier quoted context omitted.
The simulation argument comes from the fact that there a quite a lot of physics effects that are both surprising, and look an awful lot like dirty hacks that a programmer might put it. Quantum physics looks a lot like lazy evaluation (State doesn't exist until "observed"). The speed of light seems like a hack to prevent an n squared problem of everything in the universe effecting everything at the same time.
> Quantum physics looks a lot like lazy evaluation (State doesn't exist until "observed"). This is a common misconception (¿among programmers?). Let's think about the double slit experiment. https://en.wikipedia.org/wiki/Double-slit_experiment In a classical word, you must simulate only one path. In a quantum word, you must simulate both. You don´t need some magical conscious observer to force the collapse of the wav…
While the alternative seems a little too far out to be true, I have to ask, how do you know?
> So the idea that a quantum computers is better than the classical computer is opposed to the idea that quantum physics is some hack to reduce computational resources.
Keep in mind, not all operations in a computer take the same amount of time. If those qubits are entangled, you are going to get the state of all of them from a single "operation". Finally, we assume deterministic and stochastic computation take the same time, but that's only true for us because we perform stochastic computations deterministically - I'm pretty sure we could squeeze a lot more performance out of our silicon if we relaxed our accuracy constraints.
Additionally, if the universe is a computing system, the probabilistic nature of quantum mechanics may be a way to work around paradoxes, i.e. Godel's incompleteness theorem.