I would like to ask if anyone has any ideas about what a universal quantum turing machine (UQTM) can do as supposed to a classical universal turing machine (UTM) (i.e. quantum computer vs classical computer).
I wonder if a UQTM can solve NP problems as supposed to a UTM. I know that one of the biggest ideas in computability is that giving enough time the slow computer will calculate the samething as the fast computer just with more time. Since a UQTM can solve higher complexity problems (such as solving a molecular system) at faster speeds then a UTM, this doesn't mean for the UTM this is unsolvable.
Therefor, are there problems a UQTM can solve that a UTM cannot and vice-versa?
What about NP problems or non-computable problems?