The race for quantum-resistance cryptography

Nowadays, there is still no universal quantum computer being large enough to break down widely used public key encryption systems, such as AES 256 or RSA, that provide daily online information exchange. And nobody knows when it will be reality, the near or far future.
Many institutes and private entities predict a significant breakthrough this decade, companies and governments are vying to launch cryptographic solutions, in order to be prepared for future big enough, may be multibillion market.
The Shors’ algorithm proves that a future power enough quantum computer could break down the encryption systems, and thus allowing bad actors to decrypt information and spy on communications.
The governments and big companies like multinationals are increasingly concerned about the risk of ‘harvest and decrypt later attacks’, whereby an adversary steals sensitive information to decode when they have the powerful quantum computer.
It is clear that the advanced quantum cryptography efforts, such as random number generation (RNG) and quantum key distribution (QKD), still have technological limitations.
The race for quantum-resistance cryptography link:
The race for quantum-resistant cryptography | E&T Magazine (theiet.org)