Related papers: Discrete Polynomial Optimization with Coherent Net…
Recently several gain-dissipative platforms based on the networks of optical parametric oscillators, lasers, and various non-equilibrium Bose-Einstein condensates have been proposed and realised as analogue Hamiltonian simulators for…
Gain-dissipative systems of various physical origin have recently shown the ability to act as analogue minimisers of hard combinatorial optimisation problems. Whether or not these proposals will lead to any advantage in performance over the…
Recently, several platforms were proposed and demonstrated a proof-of-principle for finding the global minimum of the spin Hamiltonians such as the Ising and XY models using gain-dissipative quantum and classical systems. The implementation…
Classical spin models with discrete or continuous degrees of freedom arise in many studies of complex physical systems. A wide class of hard real-life optimisation problems can be formulated as a minimisation of a spin Hamiltonian. Here we…
A non-equilibrium open-dissipative neural network, such as a coherent Ising machine based on mutually coupled optical parametric oscillators, has been proposed and demonstrated as a novel computing machine for hard combinatorial…
There is a growing interest in investigating new states of matter using out-of-equilibrium lattice spin models in two dimensions. However, a control of pairwise interactions in such systems has been elusive as due to their nonequilibrium…
We present a non-perturbative framework for deriving effective Hamiltonians that describe low-energy excitations in quantum many-body systems. The method combines block diagonalization based on the Cederbaum--Schirmer--Meyer transformation…
This paper studies a class of distributed optimization problems with coupled equality constraints in networked systems. Many existing distributed algorithms rely on solving local subproblems via the $\operatorname{argmin}$ operator in each…
We demonstrate tunable dissipative interactions between optically trapped exciton-polariton condensates. We apply annular shaped nonresonant optical beams to both generate and confine each condensate to their respective traps, pinning their…
We devise a deterministic algorithm to efficiently sample high-quality solutions of certain spin-glass systems that encode hard optimization problems. We employ tensor networks to represent the Gibbs distribution of all possible…
Recently, continuous-time dynamical systems have proved useful in providing conceptual and quantitative insights into gradient-based optimization, widely used in modern machine learning and statistics. An important question that arises in…
Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search of…
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…
Open-dissipative systems obeying parity-time ($\mathcal{PT}$) symmetry are capable of demonstrating oscillatory dynamics akin to the conservative systems. In contrast to limit cycle solutions characteristic of nonlinear systems, the…
Differential positivity and K-cooperativity, a special case of differential positivity, extend differential approaches to control to nonlinear systems with multiple equilibria, such as switches or multi-agent consensus. To apply this…
We address the problem of simulating pair-interaction Hamiltonians in n node quantum networks where the subsystems have arbitrary, possibly different, dimensions. We show that any pair-interaction can be used to simulate any other by…
The search for new computational machines beyond the traditional von Neumann architecture has given rise to a modern area of nonlinear science -- development of unconventional computing -- requiring the efforts of mathematicians, physicists…
Asynchronous computation and gradient compression have emerged as two key techniques for achieving scalability in distributed optimization for large-scale machine learning. This paper presents a unified analysis framework for distributed…
We develop a system-theoretic framework for the structured analysis of distributed optimization algorithms with decomposable cost functions. We model such algorithms as a network of interacting dynamical systems and derive tests for…
In reservoir simulation, solution of the coupled systems of nonlinear algebraic equations that are associated with fully-implicit (backward Euler) discretization is challenging. Having a robust and efficient nonlinear solver is necessary in…