**NP-complete problems** (in general): There is no known quantum algorithm that solves NP-complete problems in polynomial time. Quantum computers are not expected to violate the Church-Turing thesis for classical problems (the Extended Church-Turing thesis is what they violate). - **Big data process