Accès ouvert
2026
preprint
OpenAlex
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, navigating the rugged energy landscapes of these systems remains difficult. To improve this navigation, classical adiabatic annealing …
Accès ouvert
2026
preprint
OpenAlex
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, navigating the rugged energy landscapes of these systems remains difficult. To improve this navigation, classical adiabatic annealing …
be
(code pays fourni par la source)
Accès ouvert
2026
preprint
OpenAlex
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 machines rely on gradient-descent-like dynamics to find solutions, which can limit speed and robustness. We investigate whether momentum and …
Accès ouvert
2026
preprint
OpenAlex
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 machines rely on gradient-descent-like dynamics to find solutions, which can limit speed and robustness. We investigate whether momentum and …
be
(code pays fourni par la source)
Accès ouvert
2026
preprint
OpenAlex
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 that their hyperparameters are carefully tuned. Their temporal evolution is often described using time-continuous dynamics. However, most experimental implementations rely …
Accès ouvert
2026
preprint
OpenAlex
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 that their hyperparameters are carefully tuned. Their temporal evolution is often described using time-continuous dynamics. However, most experimental implementations rely …
be
(code pays fourni par la source)
Accès ouvert
2026
article
OpenAlex
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 local minima. While several strategies exist to increase the chance of escaping local minima, …
be
(code pays fourni par la source)
Accès ouvert
2025
article
OpenAlex
Robbe De Prins, Jacob Lamers, Peter Bienstman, Guy Van der Sande et autres
Ising machines are specialized devices designed to efficiently solve combinatorial optimization problems. They consist of artificial spins that evolve towards a low-energy configuration representing a problem’s solution. Most realistic problems require both spin-spin couplings and external fields. In Ising machines with analog …
be
(code pays fourni par la source)
2025
conference-paper
OpenAlex
Guy Van der Sande, Toon Sevenants, Jacob Lamers, Leen Mys et autres
With the growing demand for efficient computing to tackle complex real-world challenges like combinatorial optimization, both academia and industry are exploring alternative computing paradigms. The Ising machine (IM) is one such approach, solving optimization problems by mapping their cost functions onto the …
be
(code pays fourni par la source)
2025
conference-paper
OpenAlex
Toon Sevenants, Guy Van der Sande, Guy Verschaffelt
With the increasing demand for efficient computing to address complex real-world problems like combinatorial optimization, both academia and industry are exploring alternative computing paradigms. The Ising machine (IM) is one such approach, solving complex optimization problems by mapping their cost functions onto …
be
(code pays fourni par la source)
Accès ouvert
2025
preprint
OpenAlex
Robbe De Prins, Jacob Lamers, Peter Bienstman, Guy Van der Sande et autres
Ising machines (IMs) are specialized devices designed to efficiently solve combinatorial optimization problems (COPs). They consist of artificial spins that evolve towards a low-energy configuration representing a problem's solution. Most realistic COPs require both spin-spin couplings and external fields. In IMs with …
Accès ouvert
2025
preprint
OpenAlex
Daniel Brunner, Bhavin J. Shastri, Mohammed Qadasi, Hitesh Ballani et autres
This roadmap consolidates recent advances while exploring emerging applications, reflecting the remarkable diversity of hardware platforms, neuromorphic concepts, and implementation philosophies reported in the field. It emphasizes the critical role of cross-disciplinary collaboration in this rapidly evolving field.
fr, be, de, us, ca
(code pays fourni par la source)