· Existing algorithms are not proven to be secure, even classically. Quantum encryption provides an additional level of safety, but against unknown and unexpected attacks.
· Practical quantum computers are very speculative, much more so than nuclear fusion or AI. They might not be built in the next million years.
I bet $150,000 that by January 1, 2040, a quantum computer will not exist that is able to factor a 2048-bit product of two primes. Anyone want to take me up?
It's possible that you're right that a quantum computer won't exist in 2040 that will break 2048 bit RSA, but that doesn't mean it won't be broken anyway by then.
It aught to be lower-hanging-fruit to prove that factorization is not in NC (polylog depth, polynomial component circuit) and therefore NC!=NP => (P!=NP or NC!=P) so at least one of the two probably true statements is true...