The RSA cryptosystem makes use of $n=pq$ where $p, q$ are large prime numbers.
With quantum computing, factorization might become easier, so it will probably be useful to use much much bigger $p$, $q$ in the future.
If I remember correctly, the source of large prime numbers $p$, $q$ in today's most commons RSA implementations is: probabilistic primalty tests.
In a concrete manner, what could be a possible source of much much larger primer numbers (several order of magnitudes bigger than the $p$, $q$ used today)?
