Related papers: Solving NP-hard problems with bistable polaritonic…
The Ising and Potts models, among the most important models in statistical physics, have been used for modeling binary and multinomial data on lattices in a wide variety of disciplines such as psychology, image analysis, biology, and…
Dynamical Ising machines achieve accelerated solving of complex combinatorial optimization problems by remapping the convergence to the ground state of the classical spin networks to the evolution of specially constructed continuous…
In this paper, we analyze the properties of invertible neural networks, which provide a way of solving inverse problems. Our main focus lies on investigating and controlling the Lipschitz constants of the corresponding inverse networks.…
We present a general procedure to introduce electronic polarization into classical Molecular Dynamics (MD) force-fields using a Neural Network (NN) model. We apply this framework to the simulation of a solid-liquid interface where the…
In contrast to software simulations of neural networks, hardware implementations have often limited or no tunability. While such networks promise great improvements in terms of speed and energy efficiency, their performance is limited by…
Large scale quantum annealing dynamics of Ising spin glasses were recently implemented on D-Wave's Advantage$2$ system on a range of lattices. Following extensive comparison to existing numerical methods, these experiments were claimed to…
The `lid' algorithm performs an exhaustive exploration of neighborhoods of local energy minima of energy landscapes. This paper describes an implementation of the algorithm, including issues of parallel performance and scalability. To…
We study the problem of determining the Hamiltonian of a fully connected Ising Spin Glass of $N$ units from a set of measurements, whose sizes needs to be ${\cal O}(N^2)$ bits. The student-teacher scenario, used to study learning in…
Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a…
This paper draws attention to a hardware system which can be engineered so that its intrinsic physics is described by the generalized Ising model and can encode the solution to many important NP-hard problems as its ground state. The basic…
We consider whether it is possible to find ground states of frustrated spin systems by solving them locally. Using spin glass physics and Imry-Ma arguments in addition to numerical benchmarks we quantify the power of such local solution…
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…
Networks of optical oscillators simulating coupled Ising spins have been recently proposed as a heuristic platform to solve hard optimization problems. These networks, called coherent Ising machines (CIMs), exploit the fact that the…
Motivated by the recent success of tensor networks to calculate the residual entropy of spin ice and kagome Ising models, we develop a general framework to study frustrated Ising models in terms of infinite tensor networks %, i.e. tensor…
Network partitioning has gained recent attention as a pathway to enable decentralized operation and control in large-scale systems. This paper addresses the interplay between partitioning, observability, and sensor placement (SP) in dynamic…
We investigate network of degenerate optical parametric oscillators (DOPOs) as a model of the coherent Ising machine, an architecture for solving Ising problems. The network represents the interaction in the Ising model, which is a…
I propose a new method to study computationally difficult problems. I consider a new system, larger than the one I want to simulate. The original system is recovered by imposing constraints on the large system. I simulate the large system…
We study the statistical Ising model of spins on the infinite lattice using a bootstrap method that combines spin-flip identities with positivity conditions, including reflection positivity and Griffiths inequalities, to derive rigorous…
We introduce a problem class we call Polynomial Constraint Satisfaction Problems, or PCSP. Where the usual CSPs from computer science and optimization have real-valued score functions, and partition functions from physics have monomials,…
A network of optical parametric oscillators is used to simulate classical Ising and XY spin chains. The collective nonlinear dynamics of this network, driven by quantum noise rather than thermal fluctuations, seeks out the Ising / XY ground…