Quantum annealing (QA) is a cutting-edge algorithm that leverages the unique properties of quantum computing to tackle complex combinatorial optimization problems (a class of mathematical problems ...

Quantum technologies have long been pitched as a way to fundamentally change the way drugs are discovered; to start putting the theory to the test, researchers from pharmaceutical company ...

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, ...

In computer science, normally we care about asymptotic speedup: We care about, “What is your running time as a function of the size of the problem? Does it grow linearly? Does it grow quadratically?” ...

Dr. James McCaffrey of Microsoft Research explains a new idea that slightly modifies standard simulated annealing by borrowing ideas from quantum mechanics. The goal of a combinatorial optimization ...

Are powerful quantum computers finally here? Google is claiming that its D-Wave quantum computer can solve certain problems 100 million times faster than an ordinary computer, a result that it says ...

If you want to simulate a tic-tac-toe game, that’s easy. You can evaluate every possible move in a reasonable amount of time. Simulating antennas, however, is much harder. [Rosrislav] has been ...