/sci/ - Science & Math

Why are quantum computers not superior to classical machines?
The strong Church Turing Thesis, that "Every realistic model of computation is polynomial time reducible to probabilistic Turing Machines", is disproven by quantum computation - Quantum algorithms are not polynomial time reducible to probabilistic (or deterministic) Turing Machines. By direct consequence, the idea that the universe is programmable on a turing machine is disproven and thus the Church-Turing thesis is disproven.
Even the simplest physical processes are not computable on classical machines yet nature processes them in O(1) time.
The only way it seems to salvage the situation is to give such a broad and meaningless definition of "compute" or "simulate", that you render the very thesis you're trying to defend irrelevant and useless anyway. And it is not the case that the Lambda calculus or Turing Machines can produce the quantum correlations of a quantum algorithm on the same input anyway which means they can't even produce these algorithms.