Guaranteed mapping from Simulated Bifurcation steady states to Ising ground states
Determine whether there exists a function f that, for any Ising instance H(s)=∑_{⟨i,j⟩} J_{ij} s_i s_j + ∑_i h_i s_i, maps the steady-state positions q_i^s produced by the modified Simulated Bifurcation Machine (with perfectly inelastic walls at |q_i|=1 and discretized interaction term ∑_j J_{ij} sign(q_j)) to a binary spin configuration s_i ∈ {−1,+1} that is guaranteed to be the ground state of H(s). If such a function exists, construct f and specify the conditions under which this guarantee holds.
References
In general, there is no guarantee that f maps q_is onto the ground state of~eq:Ising, s_ig. Finding a function f (if such exists) that ensures this mapping remains an open problem.
— Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines
(2411.16431 - Dziubyna et al., 25 Nov 2024) in Appendix, Section “Simulated Bifurcation Machine”