Related papers: Scalable almost-linear dynamical 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…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
Airfoil shape optimization presents a challenge where classical solvers frequently struggle with computational efficiency and local minima. In the promising paradigm of quantum computing, the coherent Ising machine (CIM), a specialized…
The exact solution of Schrodinger equation for atoms, molecules and extended systems continues to be a "Holy Grail" problem that the entire field has been striving to solve since its inception. Recently, breakthroughs have been made in the…
The challenge posted by modern science is to find a way to compute the NP-hard problem. Here we present a coherent computation model based on the whispering-gallery mode micro-resonators. We introduce the optically connected…
Nature apparently does a lot of computation constantly. If we can harness some of that computation at an appropriate level, we can potentially perform certain type of computation (much) faster and more efficiently than we can do with a von…
We study planar clusters consisting of loops including a Josephson $\pi$-junction ($\pi$-rings). Each $\pi$-ring carries a persistent current and behaves as a classical orbital moment. The type of particular state associated with the…
We show that in certain one-dimensional spin chains with open boundary conditions, the edge spins retain memory of their initial state for very long times. The long coherence times do not require disorder, only an ordered phase. In the…
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…
The paper discusses the transformation of decorated Ising models into an effective \textit{undecorated} spin models, using the most general Hamiltonian for interacting Ising models including a long range and high order interactions. The…
We study analytically the performance of a recently proposed algorithm for learning the couplings of a random asymmetric kinetic Ising model from finite length trajectories of the spin dynamics. Our analysis shows the importance of the…
An efficient Monte Carlo algorithm for the simulation of spin models with long-range interactions is discussed. Its central feature is that the number of operations required to flip a spin is independent of the number of interactions…
This paper is devoted to computational algorithms designed to describe the classical Ising magnet in some specific cases when an additional macroscopic restriction in form of constant charge density exists in the system. We developed and…
Spin chains with open boundaries, such as the transverse field Ising model, can display coherence times for edge spins that diverge with the system size as a consequence of almost conserved operators, the so-called strong zero modes. Here,…
We propose a quantum optical implementation of a class of dissipative spin systems, including the XXZ and Ising model, with ultra-cold atoms in optical lattices. Employing the motional degree of freedom of the atoms and detuned Raman…
The problem we focus on in this paper is to find a nearly optimal sliding mode controller of continuous-time nonlinear multiple-input multiple-output (MIMO) systems that can both reduce chattering and minimize the cost function, which is a…
We implemented a parallel version of the multicanonical algorithm and applied it to a variety of systems with phase transitions of first and second order. The parallelization relies on independent equilibrium simulations that only…
We consider a chain of trapped ions to interact with each other via long-range interactions. This system can be used to simulate the long-range Ising model. We study the dynamics of quantum coherence of a single spin in the chain, where the…
A quadrillion dimensional Hilbert space hosted by a quantum processor with over 50 physical qubits has been expected to be powerful enough to perform computational tasks ranging from simulations of many-body physics to complex financial…
We present several efficient implementations of the simulated annealing algorithm for Ising spin glasses on sparse graphs. In particular, we provide a generic code for any choice of couplings, an optimized code for bipartite graphs, and…