Quantum computing may actually be useful, after all
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. In a paper appearing today in Physical Review Letters, however, MIT researchers present a new algorithm that could bring the same type of efficiency to systems of linear equations — whose solution is crucial to image processing, video processing, signal processing, robot control, weather modeling, genetic analysis and population analysis, to name just a few applications. Quantum computers are computers that exploit the weird properties of matter at extremely small scales. Where a bit...
Read the whole article on MIT Research
More from MIT Research
Related
- Researchers untangle quantum quirkWed, 11 Jun 2008, 10:22:05 EDT
- Scientists create first working model of a two-qubit electronic quantum processorTue, 30 Jun 2009, 11:07:46 EDT
- Quantum computing breakthrough arises from unknown moleculeThu, 26 Jun 2008, 17:28:50 EDT
- Memoirs of a qubit: Hybrid memory solves key problem for quantum computingWed, 22 Oct 2008, 17:36:02 EDT
- Physicists find way to control individual bits in quantum computersTue, 7 Jul 2009, 10:43:59 EDT