8 papers
Performance analysis of classical adiabatic annealing on Ising machines
Jacob Lamers, Guy Verschaffelt, Guy Van der Sande
Ising machines are a promising approach to solve combinatorial optimization problems. They map these problems onto the Ising model and search for low-energy configurations. However…
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…
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…
Predicting the optimal noise strength for solving optimization problems with analog Ising machines
Leen Mys, Guy Verschaffelt, Guy Van der Sande
Analog Ising machines are dedicated hardware solvers designed to solve NP hard optimization problems. However, the global optimum is often not found as the system gets stuck in loc…
A More Convex Ising Formulation of Max-3-Cut Using Higher-Order Spin Interactions
Robbe De Prins, Guy Van der Sande, Peter Bienstman +1
Many combinatorial optimization problems (COPs) are naturally expressed using variables that take on more than two discrete values. To solve such problems using Ising machines (IMs…
How to Incorporate Higher-order Interactions in Analog Ising Machines
Robbe De Prins, Guy Van der Sande, Peter Bienstman +1
Ising machines (IMs) are specialized devices designed to efficiently solve combinatorial optimization problems. Among such problems, Boolean Satisfiability (SAT) is particularly re…