Quantum computing may actually be useful, after all

From PhysOrg.com:

In recent years, quantum computers have lost some of their luster. In the 1990s, it seemed that they might be able to solve a class of difficult but common problems — the so-called NP-complete problems — exponentially faster than classical computers. Now, it seems that they probably can't. In fact, until this week, the only common calculation where quantum computation promised exponential gains was the factoring of large numbers, which isn't that useful outside cryptography.

Full article

---

• Chronos blog home page
• Chronos Date/Time Library web site