Question: are quantum computers turing complete?
Answer: Yes. An early result from Bernstein and Vazirani (Quantum Complexity Theory ) shows that a quantum Turing machine can be used to simulate a classical Turing machine. This is enough to show that quantum Turing machines, and hence quantum computers, are Turing complete.