Investigating the Performance of an Adiabatic Quantum Optimization Processor

We calculate median adiabatic times (in seconds) of a specific superconducting adiabatic quantum processor for an NP-hard Ising spin glass instance class with up to N = 128 binary variables. To do so, we ran high performance Quantum Monte Carlo simulations on a large-scale Internet-based computing platform. We compare the median adiabatic times with the median running times of two classical solvers and find that, for problems with up to 128 variables, the adiabatic times for the simulated processor architecture are about 4 and 6 orders of magnitude shorter than the two classical solvers' times. This performance difference shows that, even in the potential absence of a scaling advantage, adiabatic quantum optimization may outperform classical solvers. 

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Geordie Rose, Kamran Karimi, Neil G. Dickson, Firas Hamze, M. H. S. Amin, Marshall Drew-Brook, Fabián A. Chudak, Paul I. Bunyk, William G. Macready
• Keywords: Adiabatic Quantum, Classical Solvers, CORR 2010, Education, Median Adiabatic Times