The Golden Age Of Quantum Computing, Once We Solve These Tiny Problems
fastcompany.com
fastcompany.com
Sorry, but that's just flat-out wrong, and this fact is a quick google search away:
"Density functional theory (DFT) is a computational quantum mechanical modelling method used in physics, chemistry and materials science to investigate the electronic structure (principally the ground state) of many-body systems, in particular atoms, molecules, and the condensed phases."[1]
[1] http://en.m.wikipedia.org/wiki/Density_functional_theory
"With this theory, the properties of a many-electron system can be determined by using functionals, i.e. functions of another function, which in this case is the spatially dependent electron density."
The object of study in DFT is the distribution of particles in the system rather than the particles themselves. Which is all well and good, but the article is technically correct in that exactly simulating n-body systems is currently out of reach (in all problem domains) if n is huge.
You can compare it with matrix multiplication: we know of several algorithms that are better than the naïve O(n^3), but they're essentially never used in practice.
Once we begin to deal with anything more complicated (e.g. two enzymes, protein folding, etc) we very quickly reach a boundary of what traditional computers can do.
I think this gives the impression that all encryption methods known today fail in the face of a quantum computer. But this is not true. There are a wide array of "post-quantum cryptography algorithms" [1], or encryption schemes thought to be secure against quantum attacks.
I suppose the author might have a particular scheme in mind which he considers the "most sophisticated."
The best quantum computers can achieve is 2x increase in speed.
Golden age of quantum computing research. That's a very different thing from a golden age of quantum computing.