| Title | Quantum Computers Can Outperform Classical Computers Due to Fixed Circuit Depth | |
| Date | Saturday October 20 2018, @06:27PM | |
| Author | martyb | |
| Topic | ||
| from the quantum-improvement dept. | ||
IBM finally proves that quantum systems are faster than classicals
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 prove quantum would always be faster in this application or whether classical systems could overtake quantum if given a sufficiently robust algorithm of its own. That is, until now.
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.
[...] What's more, the proof shows that, in these cases, the quantum algorithm can solve the problem in a fixed number of steps, regardless of how many inputs are added. With a classical computer, the more inputs you add, the more steps it needs to take in order to solve. Such are the advantages of parallel processing.
There's now proof that quantum computers can outperform classical machines
In this paper, the researchers prove that a quantum computer with a fixed circuit depth is able to outperform a classical computer that's tackling the same problem because the classical computer will require the circuit depth to grow larger, while it can stay constant for the quantum computer.
| Links |
printed from SoylentNews, Quantum Computers Can Outperform Classical Computers Due to Fixed Circuit Depth on 2024-05-16 18:37:47