Why doesn't Quantum Turing Machine contradict with Church-Turing thesis I studied about Quantum Turing machine and i figured out that the difference between QTM and TM is in transition function and also if a problem is unsolvable by a TM then it is unsolvable by a QTM but I need a justifiable reason to claim QTM does not contradict with Church-Turing thesis.
Quantum Turing machines can be simulated by classical Turing machines. See Deutsch's fundamental paper Quantum theory, the Church-Turing principle and the universal
quantum computer.