Are there any machines that are powerful than Turing machines or has violated the Church-Turing hypothesis?

Question

Basically the title.

Answer 1

Wdym by...
- "[more] powerful than a Turing machine"?
- "violated the Church-Turing [thesis]"?

Answer 2

I do not see how something could "violate" the Church-Turing thesis (did you mean that by the "Church-Turing hypothesis"?). Could you explain more in detail what you mean by that?

It is about formalizing an informal concept. One could argue that this is not the correct rendering (such as
László Kalmár did in 1959). And I guess you could violate it by finding an "effectively calculable function" that is not computable by Turing machines? But no such thing has been found so far.

Answer 3

No

Answer 4

Apparently quantum computers are equivalent individually, but there are distributed algorithms and protocols that you can do with quantum computers that doesn't work on normal TMs.