Simulated Bifurcation Algorithm Inspired by Adiabatic Quantum Computation

Abstract

Inspired by bifurcation-based adiabatic quantum computation and its classical counterpart, we propose a new heuristic algorithm for combinatorial optimization: simulated bifurcation (SB), which is based on classical adiabatic and ergodic evolutions. The SB enables ultrafast and large-scale combinatorial optimization using conventional digital computers.