Combinatorial optimization using quantum or classical driven systems*

While quantum annealers usually use ground or thermal equilibrium states for combinatorial optimization, other kinds of machines using quantum or classical driven systems have been proposed in the past several years [1-7]. Among them, Quantum bifurcation Machine (QbM) [4-7] based on quantum bifurcations of Kerr-nonlinear parametric oscillators (KPOs) [4-10] is as powerful as gate-based universal quantum computers [10-12]. A classical machine inspired by QbM, called “Simulated Bifurcation Machine (SBM),” has also exhibited high performance for large-scale combinatorial optimization [13]. Here we review QbM and SBM together with related works.
[1] S. Utsunomiya et al., Opt. Exp. 19, 18091 (2011).
[2] Z. Wang et al., Phys. Rev. A 88, 063853 (2013).
[3] I. Mahboob et al., Sci. Adv. 2, e1600236 (2016).
[4] H. Goto, J. Phys. Soc. Jpn. 88, 061015 (2019).
[5] H. Goto, Sci. Rep. 6, 21686 (2016).
[6] S. E. Nigg et al., Sci. Adv. 3, e1602273 (2017).
[7] S. Puri et al., Nat. Commun. 8, 15785 (2017).
[8] Z. Wang et al., Phys. Rev. X 9, 021049 (2019).
[9] T. Yamaji et al., arXiv:2010.02621 (2020).
[10] A. Grimm et al., Nature 584, 205 (2020).
[11] H. Goto, Phys. Rev. A 93, 050301(R) (2016).
[12] S. Puri et al., npj Quant. Inf. 3, 18 (2017).
[13] H. Goto et al., Sci. Adv. 5, eaav2372 (2019).