Quantum computers are not for everything. The only really credible application so far is factoring. Factoring is useful for breaking encryptions such as RSA. But not all encryption methods. And that's about it. There is a theoretical speed-up obtainable by Grove's algorithm for NP-complete problems, but it does not make solving NP-complete problems efficient. It only makes solving them less exponential in the theoretical worst case. This includes hard optimization problems arising in lots and lots of fields of computing. However, this is only a theoretical improvement, as none of the solution methods for these types of optimization methods actually typically run as slow as the theoretical worst-case predicts, but much much faster. So much faster, that quantum computing has no chance of getting even close. That's why it is broadly believed by experts that "lots of applications" for quantum computers as they are currently known, is just hype, with far fewer real-world applications than what some people would like us to believe. Who wants to decrypt encrypted messages? Not me. I have no use for that at all. Almost nobody does.