I've come to understand quantum computing problems are basically just specific formulations of things where multiple bad paths will just cancel out due to some

I've come to understand quantum computing problems are basically just specific formulations of things where multiple bad paths will just cancel out due to some sort of probability amplitude summing to 0. I suppose this makes sense then that the answer would be associated with some probability rather than a fixed answer. Is this theoretically likely to give near certain probability to the right answer on large problems or will it be affected by local minimums and what not? Is that the issue with scale? That noise propagates through the system and renders the uplift in problem solving moot?