Why do people bring real-life Quantum Computing to the discussion of the Church-Turing thesis? As an undergraduate with limited understanding of QC and even the C-T thesis, I have problems figuring out why in questions such as Extended Church-Turing Thesis real-life quantum stuff is even given the time of day, because it's not relevant is it?
I have always thought of the C-T thesis as a statement, specifically a statement in theoretical computer science. A statement that reads, &quot;There exists no computation model capable of recognising languages that a Turing Machine cannot&quot;. Even that is a bit messy for me. Is there a formal definition for a computation model? Finite alphabet, finite states, what exactly are we talking about here?
Whether provable or not is another story, but it's a statement that evaluates to some logical value or another. Some people say that the C-T is a statement, some actually say it's not. I have no authority in this, so I'm left as confused as ever.
And if it's not a statement, then great! It's not a problem anymore. At least from the mathematical side of things.
I have a couple of what I think are misconceptions. I've taken a look at the Chomsky Hierarchy of grammars, and at the very top lie all the so called Unrestricted Grammars which have been proven to be equally expressive as Turing Machines, apparently. Now I don't even know the formal definition for expressivity, all I have is an intuitive understanding. CFGs are more &quot;expressive&quot; than DFAs and CSGs are more &quot;expressive&quot; than CFGs etc etc, because they can recognise all the languages the prior construction can and more. Is this actually the commonly accepted definition?
Now Unrestricted Grammars specifically, allow production rules of the form $\alpha \to \beta$ where $\alpha$ is any non-empty string and $\beta$ is any string. Hence, unrestricted. How on earth could a computational model compete with something that is literally unrestricted? It makes me think of the C-T thesis as trivial, &quot;of course&quot; it's true.
This left me even more confused: What would it mean to disprove Church-Turing thesis?
The accepted answer to this question starts off with:

The Church-Turing thesis has been proved for all practical purposes.

Why is practicality suddenly worth anything in theoretical computer science?
Are there like two interpretations or more of the C-T thesis, one for &quot;practical purposes&quot; and one for &quot;mathematics&quot;?
I've written the following to talk about the connections between quantum computation and the (extended) Church-Turing thesis. Your question appears to have several other questions, which I don't address due to space (and time to write down this answer).


A statement that reads, &quot;There exists no &quot;reasonable&quot; computational model capable of recognizing languages that a Turing Machine cannot&quot;

This is essentially what the Church-Turing thesis states. It is not the extended Church-Turing thesis, which roughly takes the form:

All &quot;reasonable&quot; computational models can simulate each other with polynomial overhead

Of course, what &quot;reasonable&quot; means must itself be pinned down. For example, if you let $\mathsf{Halt}$ be an oracle to the halting problem, then the computational model $\mathsf{TM}^{\mathsf{Halt}}$ of Turing Machines equipped with halting oracles can compute strictly more than that than that of simply Turing machines.
So if $\mathsf{TM}^{\mathsf{Halt}}$ is viewed as &quot;reasonable&quot;, then the CT thesis is already false.
For this reason, &quot;reasonable&quot; is usually phrased as &quot;hypothetically realizable in the real world&quot;. As there is no proposed mechanism to create a universal $\mathsf{TM}^{\mathsf{Halt}}$ machine in the real world, this computational model would not be considered &quot;reasonable&quot;.
What does this mean for the extended CT thesis, and quantum computation? The complexity class $\mathsf{BQP}$ is the class of problems solvable (with bounded error) by a quantum computer efficiently. You should view it as a quantum analogue of $\mathsf{P}$ (more properly of $\mathsf{BPP}$, or &quot;two-sided error, randomized $\mathsf{P}$&quot;, but still).
If quantum computers (which can compute arbitrary problems in $\mathsf{BQP}$) are physically realizable, the extended Church-Turing thesis posits that they can only get a polynomial speedup over &quot;traditional&quot; models of computation. If this is the case, the extended Church-Turing thesis still holds, and quantum computing is in a certain sense &quot;more boring&quot;.
Preliminary evidence suggests that this is not the case though. There are a variety of problems which are known to have exponential speedups on quantum computers, famously factorization and the discrete logarithm problem via Shor's algorithm.
While these are large &quot;practical&quot; reasons for investigating quantum computation, they are actually not the theoretically most compelling reason.
Both factorization and discrete log are in $\mathsf{NP}\cap\mathsf{coNP}$, and therefore unlikely to be $\mathsf{NP}$-hard unless the polynomial hierarchy collapses.
This means that &quot;Shor's algorithm leads to an exponential speedup for factoring and discrete log&quot; isn't super interesting from a complexity theory point of view, as it's entirely consistent with current thoughts that both of these problems are actually in $\mathsf{P}$ (or $\mathsf{BPP}$).
There are problems which are more interesting to consider though.
In particular, the Boson sampling line of work posits a particular problem which is $\#\mathsf{P}$-hard, but is in $\mathsf{BQP}$.
This means that this particular problem is highly unlikely to be in $\mathsf{P}$, as this would collapse the polynomial hierarchy to the third level, which is thought to be unlikely by complexity theorists.
So the reason that people bring quantum computing up when discussing the (extended) Church-Turing thesis is that, if sufficiently &quot;physically realized&quot;, it provides exponential speedups on practically important problems (factoring and discrete logarithm), as well as an exponential speedup on a problem which is &quot;harder than $\mathsf{NP}$-complete&quot;. This would constitute a violation of the extended Church-Turing thesis.