相关论文: A CMOS-compatible Ising Machine with Bistable Node…
Dynamical Ising machines are based on continuous dynamical systems evolving from a generic initial state to a state strongly related to the ground state of the classical Ising model on a graph. Reaching the ground state is equivalent to…
Optical Ising machines promise to solve complex optimization problems with an optical hardware acceleration advantage. Here we study the ground state properties of a nonlinear optical Ising machine realized by spatial light modulator,…
As a quantum-inspired, non-traditional analog solver architecture, the analog Ising machine (AIM) has emerged as a distinctive computational paradigm to address the rapidly growing demand for computational power. However, the mathematical…
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…
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.…
Optimally mapping a parallel application to compute and communication resources is increasingly important as both system size and heterogeneity increase. A similar mapping problem exists in gate-based quantum computing where the objective…
This paper presents a coupled ring oscillator based Potts ma chine to solve NP-hard combinatorial optimization problems (COPs). Potts model is a generalization of the Ising model, cap turing multivalued spins in contrast to the…
Recently, purpose-built analog hardware that can efficiently minimize the Ising energy and thereby solve a variety of combinatorial optimization problems has been receiving widespread attention. In this work, we show how multidimensional,…
Analog Ising machines (IMs) occupy an increasingly prominent area of computer architecture research, offering high-quality and low latency/energy solutions to intractable computing tasks. However, IMs have a fixed capacity, with little to…
Recent technological breakthroughs have precipitated the availability of specialized devices that promise to solve NP-Hard problems faster than standard computers. These `Ising Machines' are however analog in nature and as such inevitably…
It has recently been shown that optical parametric oscillator (OPO) Ising machines, consisting of coupled optical pulses circulating in a cavity with parametric gain, can be used to probabilistically find low-energy states of Ising spin…
We present an oscillator model with both phase and amplitude dynamics for oscillator-based Ising machines (OIMs). The model targets combinatorial optimization problems with polynomial cost functions of arbitrary order and addresses…
Quantum annealing is getting increasing attention in combinatorial optimization. The quantum processing unit by D-Wave is constructed to approximately solve Ising models on so-called Chimera graphs. Ising models are equivalent to quadratic…
We introduce a methodology for generating benchmark problem sets for Ising machines---devices designed to solve discrete optimization problems cast as Ising models. In our approach, linear systems of equations are cast as Ising cost…
As we approach the physical limits predicted by Moore's law, a variety of specialized hardware is emerging to tackle specialized tasks in different domains. Within combinatorial optimization, adiabatic quantum computers, CMOS annealers, and…
As it is getting increasingly difficult to achieve gains in the density and power efficiency of microelectronic computing devices because of lithographic techniques reaching fundamental physical limits, new approaches are required to…
Time-multiplexed networks of degenerate optical parametric oscillators have demonstrated remarkable success in simulating coupled Ising spins, thus providing a promising route to solving complex combinatorial optimization problems. In these…
A folded disk is bistable, as it can be popped through to an inverted state with elastic energy localized in a small, highly-deformed region on the fold. Cutting out this singularity relaxes the surrounding material and leads to a loss of…
Ising formulations are widely utilized to solve combinatorial optimization problems, and a variety of quantum or semiconductor-based hardware has recently been made available. In combinatorial optimization problems, the existence of local…
In this study, we present a novel analytical approach to solving large-scale Ising problems by reformulating the discrete Ising Hamiltonian into a continuous framework. This transformation enables us to derive exact solutions for a…