Thanks, I updated the original post slightly to clarify a few things. It is also best to keep in mind that I am far from an expert on quantum computing and am not even a cryptographer, so this explanation is to the best of my understanding (although the only part I am uncertain about is related to Shors algorithm and how much increasing bit strength of traditional RSA hinders it. I am essentially positive that it hinders it somewhat, but from D.J.B's pdf it seems like it doesn't hinder it enough to make it realistically quantum resistant, and that multi-prime-RSA with a massive number of 4,096 bit primes is required, but that is just what I have deduced from his paper + the fact that Shors Algorithm has already been run on quantum computers to factor small numbers). If I had to take a semi-educated guess, it would be that the number of stabilized qubits required grows linearly with the bit size of the primes in traditional RSA, but that it is expected that it will be computationally infeasible to use RSA with more bits than there are stabilized qubits after the number of stabilized qubits continues to exponentially grow for some number of years into the future. Multi-prime-RSA may still be feasible for quantum resistance if enough primes are used, however rather than being completely computationally infeasible it is simply impractical (requiring multiple hard drives to hold the key).