TY - JOUR
T1 - Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
AU - Oshiyama, Hiroki
AU - Ohzeki, Masayuki
N1 - Funding Information:
We thank Murray Thom, Catherine McGeoch, Hayato Goto, and Yoshihiko Nishikawa for fruitful discussion on our benchmark tests. In addition, we acknowledge research supports on various aspects from D-Wave Systems Inc. and TOSHIBA CORPORA-TION. M. O. thanks financial support from JSPS KAKENHI Grant Number 20H02168, the Next Generation High-Performance Computing Infrastructures and Applications R & D Program by MEXT, and MEXT-Quantum Leap Flagship Program Grant Number JPMXS0120352009.
Funding Information:
We thank Murray Thom, Catherine McGeoch, Hayato Goto, and Yoshihiko Nishikawa for fruitful discussion on our benchmark tests. In addition, we acknowledge research supports on various aspects from D-Wave Systems Inc. and TOSHIBA CORPORA-TION. M. O. thanks financial support from JSPS KAKENHI Grant Number 20H02168, the Next Generation High-Performance Computing Infrastructures and Applications R & D Program by MEXT, and MEXT-Quantum Leap Flagship Program Grant Number JPMXS0120352009.
Publisher Copyright:
© 2022, The Author(s).
PY - 2022/12
Y1 - 2022/12
N2 - Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their performance for various types of problems. In this study, the performance of four quadratic unconstrained binary optimization problem solvers, namely D-Wave Hybrid Solver Service (HSS), Toshiba Simulated Bifurcation Machine (SBM), Fujitsu Digital Annealer (DA), and simulated annealing on a personal computer, was benchmarked. The problems used for benchmarking were instances of real problems in MQLib, instances of the SAT-UNSAT phase transition point of random not-all-equal 3-SAT (NAE 3-SAT), and the Ising spin glass Sherrington-Kirkpatrick (SK) model. Concerning MQLib instances, the HSS performance ranked first; for NAE 3-SAT, DA performance ranked first; and regarding the SK model, SBM performance ranked first. These results may help understand the strengths and weaknesses of these solvers.
AB - Recently, inspired by quantum annealing, many solvers specialized for unconstrained binary quadratic programming problems have been developed. For further improvement and application of these solvers, it is important to clarify the differences in their performance for various types of problems. In this study, the performance of four quadratic unconstrained binary optimization problem solvers, namely D-Wave Hybrid Solver Service (HSS), Toshiba Simulated Bifurcation Machine (SBM), Fujitsu Digital Annealer (DA), and simulated annealing on a personal computer, was benchmarked. The problems used for benchmarking were instances of real problems in MQLib, instances of the SAT-UNSAT phase transition point of random not-all-equal 3-SAT (NAE 3-SAT), and the Ising spin glass Sherrington-Kirkpatrick (SK) model. Concerning MQLib instances, the HSS performance ranked first; for NAE 3-SAT, DA performance ranked first; and regarding the SK model, SBM performance ranked first. These results may help understand the strengths and weaknesses of these solvers.
UR - http://www.scopus.com/inward/record.url?scp=85124327793&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85124327793&partnerID=8YFLogxK
U2 - 10.1038/s41598-022-06070-5
DO - 10.1038/s41598-022-06070-5
M3 - Article
C2 - 35140264
AN - SCOPUS:85124327793
SN - 2045-2322
VL - 12
JO - Scientific Reports
JF - Scientific Reports
IS - 1
M1 - 2146
ER -