Ballistic Simulated Bifurcation
A classical combinatorial optimization heuristic inspired by quantum adiabatic evolution. It retains continuous momentum and position; particles travel in near-ballistic trajectories within potential wells and reverse their momentum upon hitting a wall, giving a strong ability to escape local minima.
Timeline (last 90 days)
vq-logics-opt/bsb_solver.py implements ballistic simulated bifurcation (bSB), a classical algorithm inspired by quantum adiabatic evolution, which outperforms standard greedy heuristics on Max-Cut and QUBO problems.
Simulated bifurcation has two main variants: discrete simulated bifurcation (dSB) suits low-latency hardware; ballistic simulated bifurcation (bSB) preserves continuous momentum and position and has a stronger ability to escape local minima.
All Facts (2)
vq-logics-opt/bsb_solver.py implements ballistic simulated bifurcation (bSB), a classical algorithm inspired by quantum adiabatic evolution, which outperforms standard greedy heuristics on Max-Cut and QUBO problems.
50%UnverifiedSimulated bifurcation has two main variants: discrete simulated bifurcation (dSB) suits low-latency hardware; ballistic simulated bifurcation (bSB) preserves continuous momentum and position and has a stronger ability to escape local minima.
50%