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 does not provide a speed-up compared to classical computing when time is limited, according to a study in Nature Communications.
Click here for original story, Quantum annealing can beat classical computing in limited cases
Source: Phys.org