STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Exact algorithms for NP-hard problems: a survey
Combinatorial optimization - Eureka, you shrink!
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
International Journal of High Performance Computing Applications
Finding cliques by quantum adiabatic evolution
Quantum Information & Computation
Importance of explicit vectorization for CPU and GPU software performance
Journal of Computational Physics
Adapting the traveling salesman problem to an adiabatic quantum computer
Quantum Information Processing
Quantum adiabatic machine learning
Quantum Information Processing
Hi-index | 0.00 |
Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum gap during the adiabatic quantum optimization for an NP-hard Ising spin glass instance class with up to 128 binary variables. Using parameters obtained from a realistic superconducting adiabatic quantum processor, we extract the minimum gap and matrix elements using 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 the considered problem sizes, the adiabatic times for the simulated processor architecture are about 4 and 6 orders of magnitude shorter than the two classical solvers' times. This shows that if the adiabatic time scale were to determine the computation time, adiabatic quantum optimization would be significantly superior to those classical solvers for median spin glass problems of at least up to 128 qubits. We also discuss important additional constraints that affect the performance of a realistic system.