The class of this problems where quantum computing gives an advantage is called BQP and it includes things like factoring but it is not known to include NP comp

The class of this problems where quantum computing gives an advantage is called BQP and it includes things like factoring but it is not known to include NP complete problems like the traveling salesman.