But, a quantum computer would not in general solve NP-hard problems in polynomial time (as far as we know). The known exponential speedups are for "easier" problems like factoring and finding quantum ground states, which are not NP-hard.