IBM finally proves that quantum systems are faster than classicals

Engadget 

In 1994, MIT professor of applied mathematics, Peter Shor, developed a groundbreaking quantum computing algorithm capable of factoring numbers (that is, finding the prime numbers for any integer N) using quantum computer technology. For the next decade, this algorithm provided a tantalizing glimpse at the potential prowess of quantum computing versus classical systems. However researchers could never definitively prove that quantum would always be faster in this application or whether classical systems could overtake quantum if given a sufficiently robust algorithm of its own. In a paper published Thursday in the journal Science, Dr. Sergey Bravyi and his team reveal that they've developed a mathematical proof which, in specific cases, illustrates the quantum algorithm's inherent computational advantages over classical. "It's good to know, because results like this become parts of algorithms," Bob Sutor, vice president of IBM Q Strategy and Ecosystem, told Engadget.

  Industry: Information Technology (0.62)
  Technology: Information Technology > Hardware (1.00)