Integer factorization for codebreaking is a military or criminal application, not a commercial one. Someone will make money doing it, but it won't be contributing to society in the way we normally mean when talking about commerce. It would be like saying nukes have commercial applications.
"Quantum simulation" is too vague to speak to applicability in any domain. There is no proven or empirically demonstrated exponential speedup on any simulation problem with known commercial applications.
This paper claims quantum computer can integrate arbitrary non-linear differential equations with quantum advantage:
https://arxiv.org/pdf/2011.06571.pdf
It does seems too good to be true.
I found a layman's explanation at Quanta Magazine: https://www.quantamagazine.org/new-quantum-algorithms-finall...
The two caveats are
1. Only works for "mildly" nonlinear equations
2. Results are in quantum world and have to be translated back into normal deterministic world results, and this hasn't been figured out yet
Why would integer factorization be commercially relevant? Only practical use of that (as far as I'm aware) is breaking RSA. Hopefully people will just switch to known quantum secure algorithms. It'll be a nothing burger.
Switching a few key libraries like OpenSSL to using quantum-resistant cryptography is WAY WAY easier than constructing a viable quantum computer (in secret) that is able to break 512 bit or 1024 bit key RSA.
Integer factorization is relevant only because integer factorization is currently considered to be computationally difficult and effectively impossible. If this ceases to be the case (effective QC hardware, or perhaps some math breakthrough), the effect is simply that integer factorization stops being a valid security or proof-of-work measure and thus it ceases to be used, not that breaking integer factorization becomes a viable commercial industry.
Integer factorization and quantum simulation would be two examples of commercially highly relevant applications where an exponential speed-up applies.