activity
20242026
most citedUsing continuation methods to analyse the difficulty of problems solved by Ising machines

8 citations · 10 across the 5 of their papers we have counts for

collaborators

5 papers

physics.app-ph2026

Beyond Gradient Descent: Adam for Analog Ising Machines

Stijn Van Vooren, Guy Van der Sande, Guy Verschaffelt

As Moore's law reaches its limits, Ising machines offer a promising alternative computing approach for difficult optimization problems. However, many analog, time-continuous Ising…

cs.LG2026

Reducing hyperparameter sensitivity in measurement-feedback based Ising machines

Toon Sevenants, Guy Van der Sande, Guy Verschaffelt

Analog Ising machines have been proposed as heuristic hardware solvers for combinatorial optimization problems, with the potential to outperform conventional approaches, provided t…

cond-mat.stat-mech2025

How to Incorporate External Fields in Analog Ising Machines

Robbe De Prins, Jacob Lamers, Peter Bienstman +3

Ising machines (IMs) are specialized devices designed to efficiently solve combinatorial optimization problems (COPs). They consist of artificial spins that evolve towards a low-en…

physics.app-ph2024★ 2 cited

Requirements on bit resolution in optical Ising machine implementations

Toon Sevenants, Guy Van der Sande, Guy Verschaffelt

Optical Ising machines have emerged as a promising dynamical hardware solver for computational hard optimization problems. These Ising machines typically require an optical modulat…

cond-mat.dis-nn2024★ 8 cited

Using continuation methods to analyse the difficulty of problems solved by Ising machines

Jacob Lamers, Guy Verschaffelt, Guy Van der Sande

Ising machines are dedicated hardware solvers of NP-hard optimization problems. However, they do not always find the most optimal solution. The probability of finding this optimal…