Quantum annealing can beat classical computing in limited cases

Recent research proves that under certain conditions, quantum annealing computers can run algorithms—including the well-known Shor's algorithm—more quickly than classical computers. In most cases, however, quantum annealing ...

Is your supercomputer stumped? There may be a quantum solution

Some math problems are so complicated that they can bog down even the world's most powerful supercomputers. But a wild new frontier in computing that applies the rules of the quantum realm offers a different approach.

New algorithm optimizes quantum computing problem-solving

Tohoku University researchers have developed an algorithm that enhances the ability of a Canadian-designed quantum computer to more efficiently find the best solution for complicated problems, according to a study published ...

Scott Aaronson on Google's new quantum-computing paper

In 2010, a Canadian company called D-Wave announced that it had begun production of what it called the world's first commercial quantum computer, which was based on theoretical work done at MIT. Quantum computers promise ...

page 1 from 2