Related papers: Constructing and proving the ground state of a gen…
Many combinatorial problems can be mapped to Ising machines, i.e., networks of coupled oscillators that settle to a minimum-energy ground state, from which the problem solution is inferred. This work proposes DROID, a novel event-driven…
Dynamical Ising machines are actively investigated from the perspective of finding efficient heuristics for NP-hard optimization problems. However, the existing data demonstrate super-polynomial scaling of the running time with the system…
We contribute to the mathematical theory of the design of low temperature Ising machines, a type of experimental probabilistic computing device implementing the Ising model. Encoding the output of a function in the ground state of a…
Large numbers of ground states of two-dimensional Ising spin glasses with periodic boundary conditions in both directions are calculated for sizes up to 40^2. A combination of a genetic algorithm and Cluster-Exact Approximation is used. For…
We consider a one-dimensional spin chain for which the ground state is the cluster state, capable of functioning as a quantum computational wire when subjected to local adaptive measurements of individual qubits, and investigate the…
An extension of the projected entangled-pair states (PEPS) algorithm to infinite systems, known as the iPEPS algorithm, was recently proposed to compute the ground state of quantum systems on an infinite two-dimensional lattice. Here we…
In this article, we investigate the energy landscape and metastable behavior of the Ising and Potts models on two-dimensional square or hexagonal lattices in the low temperature regime, especially in the absence of an external magnetic…
A systematic study of both classical and quantum geometric frustrated Ising models with a competing ordering mechanism is reported in this paper. The ordering comes in the classical case from a coupling of 2D layers and in the quantum model…
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…
The Ising spin glass in two dimensions exhibits rich behavior with subtle differences in the scaling for different coupling distributions. We use recently developed mappings to graph-theoretic problems together with highly efficient…
Given the fundamental importance of combinatorial optimization across many diverse application domains, there has been widespread interest in the development of unconventional physical computing architectures that can deliver better…
Decades of exponential scaling in high performance computing (HPC) efficiency is coming to an end. Transistor based logic in complementary metal-oxide semiconductor (CMOS) technology is approaching physical limits beyond which further…
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…
A ``ballistic-search'' algorithm is presented which allows the identification of clusters (or funnels) of ground states in Ising spin glasses even for moderate system sizes. The clusters are defined to be sets of states, which are connected…
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…
We describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The running time of the algorithm grows linearly with the number of…
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between planar and non-planar interaction graphs, and thus fails to…
The infinite Projected Entangled Pair States (iPEPS) algorithm [J. Jordan et al, PRL 101, 250602 (2008)] has become a useful tool in the calculation of ground state properties of 2d quantum lattice systems in the thermodynamic limit.…
All ground states and low-lying excitations of a +/- I Ising spin glass model on a cubic 4 x 4 x 4 lattice with periodical boundary conditions were calculated using a method of combinatorical optimization. The structure of states in the…
As a means to solve optimization problems using quantum computers, the problem is typically recast into a Ising spin model whose ground-state is the solution of the optimization problem. An alternative to the Ising formulation is the…