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

Most Recent News

How RBS Made a Quantum Leap into the Future

July 5, 2020 – The Sunday Times “In the shadow of a giant airship hangar on a defunct navy base in Silicon Valley, Ross McEwan sat down for a presentation about the future. It was 2015, and the then boss of Royal Bank of Scotland already had his hands full...

XrAI Trans Canadian Roll Out To Fight COVID-19

1QBit and Canadian health care providers team up to empower front-line clinicians with Health Canada’s first approved AI tool for radiology in the fight against COVID-19  Health and technology providers have joined forces to deploy XrAI, a machine learning tool that...