Quantum Annealing Results from Google


December 8, 2015
Google has crafted problems to demonstrate that quantum annealing can offer runtime advantages for hard optimization problems that are characterized by rugged energy landscapes with tall and narrow energy barriers. For problem instances involving 945 binary variables, writes Hartmut Neven, Director of Engineering at Google’s Quantum Artificial Intelligence Lab, quantum annealing is more than 108 times faster than simulated annealing running on a single core, and sometimes just as much faster than a classically run quantum Monte Carlo algorithm that emulates quantum tunnelling.

Google Research Blog post   |   Article preprint