Is this possible that quantum computer will be able to violate the Church thesis? After reading Church's thesis, and godelization theory, it seems everything is futile, is this really true, all the machines we are making machine which is same as before, bounded to not solve halting problems, in more simple terms can quantum computer do anything that a Turing machine can't?
PS: In book named Elements of theory of computation first edition, you will find Godelization otherwise it is redacted since second edition reason unknown but chapter 5 named Church Thesis is highly altered since second edition.
No.  A classical computer can compute anything a quantum computer can do, given long enough.  There are simple methods of simulation that cause an exponential slowdown, which suffices to show that if it is decidable on a quantum computer, it is decidable on a classical computer.  (We don't know whether the there might be other faster ways of simulating a quantum computer on a classical computer, but that doesn't affect decidability.)