Ising machines solve combinatorial optimization problems by simulating spin systems that settle into low-energy configurations. The fundamental tension: exploration (escaping local minima to find better solutions) versus exploitation (converging quickly once near the optimum). Hardware Ising machines face this as a speed-quality tradeoff — faster convergence means more local minima trapped, while better exploration means slower convergence.
Wang et al. introduce a single tunable parameter that resolves this by switching between two dynamical modes. In Bounce mode, the parameter accelerates escape from local minima by amplifying the energy gained from spin flips, making the system restless. In Bind mode, the same parameter accelerates convergence by damping oscillations, making the system settle. The energy landscape is unchanged — the spins see the same couplings, the same problem. Only the dynamics change.
The speedups are substantial: 6.15× on dense MAX-CUT problems, 27.3× on sparse 3-XORSAT, with negligible additional hardware cost. The improvement scales differently across problem structures because the bottleneck differs — dense problems need more escape from deep local minima, sparse problems need faster traversal of flat energy regions.
The through-claim is about the decoupling of landscape and dynamics. Standard approaches to improving optimization modify the energy landscape — adding penalty terms, smoothing barriers, decomposing the problem. This approach leaves the landscape untouched and modifies only the trajectory through it. The same terrain, walked differently, yields different solutions. The bottleneck was never in the problem's structure. It was in the dynamics of search.