But the main point of this piece has nothing to do with quantum computing.
One of the common examples and a strong motivation for the development of a quantum computer is that it will allow to brake large numbers into its prime multiples, and also searching large databases much faster than a regular computer.
So, why not develop a large database of prime numbers and their products? Instead of actually braking down a large number into its prime multiples, just find that number in a database, and use already know factors? Turns out that database would have been way too large, simply impossible to be created.
The next question is why don’t put some extra funding into the number theory? The Fermat’s Last Theorem has been proved. Maybe with some extra push, someone will finally find a general equation for prime numbers? That could help with decryption problem maybe even faster than development of a quantum computer.
The Core Assumption of Every Known Single-Photon Experiment Is Wrong