I've been trying to learn about that damned quantum computing demonstration from D-Wave for a while now. Ars Technica's article is the first one that's satisfied me.
The most important detail: Quantum computing, at least as D-WAVE has it, does not mean that NP-complete problems will be solvable in polynomial time. I had heretofore been under the impression that they might be.
Thus, computer scientists will not be rendered obsolete.
Thank you, Ars Technica, for clearing that up.
arch detail
No comments:
Post a Comment