Quantum computers are not generically good at all parallel problems. They have better asymptotic runtime for “brute force search” type problems, where you know there is some answer but you have to guess-and-check repeatedly. Roughly they change a 2^n brute force algorithm to a 2^(n/2) algorithm in that case. The main area these problems are important is cryptography.