Searcharxiv⌕ Search

arXiv subjects

Guy Van der Sande

Publications and source records attributed to Guy Van der Sande.

At least 19 recordsLinked to original sources

Performance analysis of classical adiabatic annealing on Ising machines

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 has been proposed in the literature as a heuristic optimization method for classical Ising machines. Using this technique, the Hamiltonian of the Ising machine is gradually transformed from an easily solvable Hamiltonian to the target Hamiltonian. However, its purported effectiveness is primarily motivated by an analogy to quantum adiabatic annealing, and systematic benchmarking has remained limited. In this work, we analyze the classical adiabatic annealing technique using continuation methods. Motivated by insights from this analysis, we propose an optimized annealing strategy we refer to as hybrid classical adiabatic annealing. We benchmark our proposed strategy using MaxCut instances with up to 800 spins and problems with external fields, for which it achieves a marginal improvement for a limited set of problems. We conclude that, although theoretically motivated and occasionally beneficial, the hybrid strategy does not offer a sufficient practical advantage over simpler, existing techniques.

quant-ph↗

Beyond Gradient Descent: Adam for Analog Ising Machines

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 Adam optimization can improve these systems. Since these optimizers are traditionally formulated in discrete time, we derive continuous-time versions suitable for analog, time-continuous Ising-machine dynamics. On Max-Cut benchmarks, we find that Adam-based dynamics substantially reduce time-to-target and improve solution quality compared with gradient-descent- and momentum-based dynamics. We further introduce a first-order continuous-time approximation of Adam that is intended as a simpler starting point for future physical implementations and while performing better than the full Adam formulation in a continuous-time setting. We also study a purely algorithmic discrete-time setting, where the performance gap is reduced on easier problem instances, while the Adam-based update rule performs best on harder weighted problem instances. These results identify continuous-time Adam dynamics as a powerful design principle for analog Ising machines.

physics.app-ph↗

Reducing hyperparameter sensitivity in measurement-feedback based Ising machines

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 on measurement-feedback architectures that operate in a time-discrete manner. We observe that in such setups, the range of effective hyperparameters is substantially smaller than in the envisioned time-continuous analog Ising machine. In this paper, we analyze this discrepancy and discuss its impact on the practical operation of Ising machines. Next, we propose and experimentally verify a method to reduce the sensitivity to hyperparameter selection of these measurement-feedback architectures.

cs.LG↗

Predicting the optimal noise strength for solving optimization problems with analog Ising machines

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, often these methods needs extensive parameter tuning. In this work, we investigate the injection of large noise as a scheme on its own and in combination with annealing to improve the success rate and the time-to-solution (TTS) of analog Ising machines for MaxCut problems. We demonstrate that optimizing the noise improves the TTS by several orders and makes both approaches competitive with the state-of-the-art, such as chaotic amplitude control. Moreover, we are able to predict a good noise value based on the problem connectivity and coupling strength, eliminating the need for costly parameter optimization.

physics.app-ph↗

A More Convex Ising Formulation of Max-3-Cut Using Higher-Order Spin Interactions

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) - specialized analog or digital devices designed to solve COPs efficiently - these multi-valued integers must be encoded using binary spin variables. A common approach is one-hot encoding, where each variable is represented by a group of spins constrained so that exactly one spin is in the "up" state. However, this encoding introduces energy barriers: changing an integer's value requires flipping two spins and passing through an invalid intermediate state. This creates rugged energy landscapes that may hinder optimization. We propose a higher-order Ising formulation for Max-3-Cut, which is the smallest fundamental COP with multi-valued integer variables. Our formulation preserves valid configurations under single-spin updates. The resulting energy landscapes are smoother, and we show that this remains true even when the binary variables are relaxed to continuous values, making it well-suited for analog IMs as well. Benchmarking on such an IM, we find that the higher-order formulation leads to significantly faster solutions than the Ising baseline. Interestingly, we find that an empirical rescaling of some terms in the Ising formulation - a heuristic proposed in prior work - approaches the performance of the higher-order Ising formulation, underscoring the importance of empirical parameter tuning in COP encodings.

cond-mat.stat-mech↗

How to Incorporate Higher-order Interactions in Analog Ising Machines

Ising machines (IMs) are specialized devices designed to efficiently solve combinatorial optimization problems. Among such problems, Boolean Satisfiability (SAT) is particularly relevant in industrial applications. To solve SAT problems using IMs, it is crucial to incorporate higher-order interactions. However, in analog IMs, interactions of different orders scale unevenly with the continuous spin amplitudes, introducing imbalances that can significantly degrade performance. We present a numerical comparison of methods to mitigate these imbalances, evaluating time-to-solution and success rate on Uniform Random 3-SAT instances from the SATLIB benchmark set. Our results show that the most effective approach employs spin interactions that are proportional to the signs of spins, rather than their continuous amplitudes. This generalizes our previous work, which showed that such interactions best mitigate imbalances induced by external fields in quadratic analog IMs. In this work, its advantage becomes substantially more pronounced, as it naturally mitigates imbalances across all interaction orders. We further demonstrate that smooth approximations of this method make it compatible with analog hardware. Our findings underscore the central role of spin-sign-based interactions in enabling robust and scalable analog IM dynamics.

cond-mat.stat-mech↗

How to Incorporate External Fields in Analog Ising Machines

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 analog spins, these interactions scale differently with the continuous spin amplitudes, leading to imbalances that affect performance. Various techniques have been proposed to mitigate this issue, but their performance has not been benchmarked. We address this gap through a numerical analysis. We evaluate the time-to-solution of these methods across three distinct problem classes with up to 500 spins. Our results show that the most effective way to incorporate external fields is through an approach where the spin interactions are proportional to the spin signs, rather than their continuous amplitudes.

cond-mat.stat-mech↗

Requirements on bit resolution in optical Ising machine implementations

Optical Ising machines have emerged as a promising dynamical hardware solver for computational hard optimization problems. These Ising machines typically require an optical modulator to represent the analog spin variables of these problems. However, modern day optical modulators have a relatively low modulation resolution. We therefore investigate how the low bit-resolution of optical hardware influences the performance of this type of novel computing platform. Based on numerical simulations, we determine the minimum required bit-resolution of an optical Ising machine for different benchmark problems of different sizes. Our study shows that a limited bit-resolution of 8bit is sufficient for the optical modulator. Surprisingly, we also observe that the use of a 1bit-resolution modulator significantly improves the performance of the Ising machine across all considered benchmark problems.

physics.app-ph↗

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

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 solution depends on the problem at hand. Using continuation methods, we show that this is closely linked to the bifurcation sequence of the optimal solution. From this bifurcation analysis, we can determine the effectiveness of solution schemes. Moreover, we find that the proper choice of implementation of the Ising machine can drastically change this bifurcation sequence and therefore vastly increase the probability of finding the optimal solution.

cond-mat.dis-nn↗

A Quantum Optical Recurrent Neural Network for Online Processing of Quantum Times Series

Over the last decade, researchers have studied the synergy between quantum computing (QC) and classical machine learning (ML) algorithms. However, measurements in QC often disturb or destroy quantum states, requiring multiple repetitions of data processing to estimate observable values. In particular, this prevents online (i.e., real-time, single-shot) processing of temporal data as measurements are commonly performed during intermediate stages. Recently, it was proposed to sidestep this issue by focusing on tasks with quantum output, thereby removing the need for detectors. Inspired by reservoir computers, a model was proposed where only a subset of the internal parameters are optimized while keeping the others fixed at random values. Here, we also process quantum time series, but we do so using a quantum optical recurrent neural network (QORNN) of which all internal interactions can be trained. As expected, this approach yields higher performance, as long as training the QORNN is feasible. We further show that our model can enhance the transmission rate of quantum channels that experience certain memory effects. Moreover, it can counteract similar memory effects if they are unwanted, a task that could previously only be solved when redundantly encoded input signals were available. Finally, we run a small-scale version of this last task on the photonic processor Borealis, demonstrating that our QORNN can be constructed using currently existing hardware.

quant-ph↗

Noise-injected analog Ising machines enable ultrafast statistical sampling and machine learning

Ising machines are a promising non-von-Neumann computational concept for neural network training and combinatorial optimization. However, while various neural networks can be implemented with Ising machines, their inability to perform fast statistical sampling makes them inefficient for training neural networks compared to digital computers. Here, we introduce a universal concept to achieve ultrafast statistical sampling with analog Ising machines by injecting noise. With an opto-electronic Ising machine, we experimentally demonstrate that this can be used for accurate sampling of Boltzmann distributions and for unsupervised training of neural networks, with equal accuracy as software-based training. Through simulations, we find that Ising machines can perform statistical sampling orders-of-magnitudes faster than software-based methods. This enables the use of Ising machines beyond combinatorial optimization and makes them into efficient tools for machine learning and other applications.

physics.app-ph↗

Order-of-magnitude differences in computational performance of analog Ising machines induced by the choice of nonlinearity

Ising machines based on nonlinear analog systems are a promising method to accelerate computation of NP-hard optimization problems. Yet, their analog nature is also causing amplitude inhomogeneity which can deteriorate the ability to find optimal solutions. Here, we investigate how the system's nonlinear transfer function can mitigate amplitude inhomogeneity and improve computational performance. By simulating Ising machines with polynomial, periodic, sigmoid and clipped transfer functions and benchmarking them with MaxCut optimization problems, we find the choice of transfer function to have a significant influence on the calculation time and solution quality. For periodic, sigmoid and clipped transfer functions, we report order-of-magnitude improvements in the time-to-solution compared to conventional polynomial models, which we link to the suppression of amplitude inhomogeneity induced by saturation of the transfer function. This provides insights into the suitability of systems for building Ising machines and presents an efficient way for overcoming performance limitations.

physics.app-ph↗

Demonstrating Delay-based Reservoir Computing Using a Compact Photonic Integrated Chip

Photonic delay-based reservoir computing (RC) has gained considerable attention lately, as it allows for simple technological implementations of the RC concept that can operate at high speed. In this paper, we discuss a practical, compact and robust implementation of photonic delay-based RC, by integrating a laser and a 5.4cm delay line on an InP photonic integrated circuit. We demonstrate the operation of this chip with 23 nodes at a speed of 0.87GSa/s, showing performances that are similar to previous non-integrated delay-based setups. We also investigate two other post-processing methods to obtain more nodes in the output layer. We show that these methods improve the performance drastically, without compromising the computation speed.

physics.app-ph↗

Distributed Kerr Nonlinearity in a Coherent All-Optical Fiber-Ring Reservoir Computer

We investigate, both numerically and experimentally, the usefulness of a distributed nonlinearity in a passive coherent photonic reservoir computer. This computing system is based on a passive coherent optical fiber-ring cavity in which part of the nonlinearities are realized by the Kerr nonlinearity. Linear coherent reservoirs can solve difficult tasks but are aided by nonlinear components in their input or output layer. Here, we compare the impact of nonlinear transformations of information in the reservoir input layer, its bulk - the fiber-ring cavity - and its readout layer. For the injection of data into the reservoir, we compare a linear input mapping to the nonlinear transfer function of a Mach Zehnder modulator. For the reservoir bulk, we quantify the impact of the optical Kerr effect. For the readout layer we compare a linear output to a quadratic output implemented by a photodiode. We find that optical nonlinearities in the reservoir itself, such as the optical Kerr nonlinearity studied in the present work, enhance the task solving capability of the reservoir. This suggests that such nonlinearities will play a key role in future coherent all-optical reservoir computers.

physics.app-ph↗

Solitary and Coupled Semiconductor Ring Lasers as Optical Spiking Neurons

We theoretically investigate the possibility of generating pulses in an excitable (asymmetric) semiconductor ring laser (SRL) using optical trigger pulses. We show that the phase difference between the injected field and the electric field inside the SRL determines the direction of the perturbation in phase space. Due to the folded shape of the excitability threshold, this has an important influence on the ability to cross it. A mechanism for exciting multiple consecutive pulses using a single trigger pulse (i.e. multi pulse excitability) is revealed. We furthermore investigate the possibility of using asymmetric SRLs in a coupled configuration, which is a first step toward an all-optical neural network using SRLs as building blocks.

physics.optics↗

Excitability in optical systems close to Z2-symmetry

We report theoretically and experimentally on excitability in semiconductor ring lasers in order to reveal a mechanism of excitability, general for systems close to Z2-symmetry. The global shapes of the invariant manifolds of a saddle in the vicinity of a homoclinic loop determine the origin of excitability and the fea- tures of the excitable pulses. We show how to experimentally make a semiconductor ring laser excitable by breaking the Z2-symmetry in a controlled way. The experiments confirm the theoretical predictions.

physics.optics↗

Nonlocality-induced front interaction enhancement

We demonstrate that nonlocal coupling strongly influences the dynamics of fronts connecting two equivalent states. In two prototype models we observe a large amplification in the interaction strength between two opposite fronts increasing front velocities several orders of magnitude. By analyzing the spatial dynamics we prove that way beyond quantitative effects, nonlocal terms can also change the overall qualitative picture by inducing oscillations in the front profile. This leads to a mechanism for the formation of localized structures not present for local interactions. Finally, nonlocal coupling can induce a steep broadening of localized structures, eventually annihilating them.

nlin.PS↗

Negative diffraction pattern dynamics in nonlinear cavities with left-handed materials

We study a ring cavity filled with a slab of a right-handed material and a slab of a left-handed material. Both layers are assumed to be nonlinear Kerr media. First, we derive a model for the propagation of light in a left-handed material. By constructing a mean-field model, we show that the sign of diffraction can be made either positive or negative in this resonator, depending on the thicknesses of the layers. Subsequently, we demonstrate that the dynamical behavior of the modulation instability is strongly affected by the sign of the diffraction coefficient. Finally, we study the dissipative structures in this resonator and reveal the predominance of a two-dimensional up-switching process over the formation of spatially periodic structures, leading to the truncation of the homogeneous hysteresis cycle.

nlin.PS↗