> This result is the first experimental challenge against the extended Church-Turing thesis, which states that classical computers can efficiently implement any “reasonable” model of computation. With the first quantum computation that cannot reasonably be emulated on a classical computer, we have opened up a new realm of computing to be explored.

Note, that the "extended Church-Turing thesis"[1] says something very different than the actual "Church-Turing thesis" (and is also not due to either Church or Turing).

The original Church-Turing thesis is not challenged at all by these experiments. Indeed, it has been shown that quantum Turing machines are not computationally more powerful than deterministic Turing machines - as in: any program that can be computed by a quantum Turing machine can in principle also be computed by a deterministic Turing machine (it just might take a little/a lot longer).

The extended Church-Turing thesis is concerned with the performance of a computation and says something about the "efficiency" of the computation.

The original thesis is concerned with what's possible, while the extended thesis is concerned with what's feasible.

[1] https://en.wikipedia.org/wiki/Church%E2%80%93Turing_thesis#V...