Related papers: Antiferromagnetic spatial photonic Ising machine t…
The Ising model on ``thin'' graphs (standard Feynman diagrams) displays several interesting properties. For ferromagnetic couplings there is a mean field phase transition at the corresponding Bethe lattice transition point. For…
The growth of artificial intelligence and IoT has created a significant computational load for solving non-deterministic polynomial-time (NP)-hard problems, which are difficult to solve using conventional computers. The Ising computer,…
Non-circuit theory drift-diffusion numerical simulation of standard potentiostatic impedance spectroscopy (IS) is a well-known strategy for characterization of materials and electronic devices. It implies the time-dependent solutions from…
Combinatorial optimization problems become computationally intractable as these NP-hard problems scale. We previously proposed extraction-type majority voting logic (E-MVL), a quantum-inspired algorithm using digital logic circuits. E-MVL…
In this note we overview recent convergence results for correlations in the critical planar nearest-neighbor Ising model. We start with a short discussion of the combinatorics of the model and a definition of fermionic and spinor…
Spintronic devices offer a promising avenue for the development of nanoscale, energy-efficient artificial neurons for neuromorphic computing. It has previously been shown that with antiferromagnetic (AFM) oscillators, ultra-fast spiking…
In recent years, analog quantum simulators have reached unprecedented quality, both in qubit numbers and coherence times. Most of these simulators natively implement Ising-type Hamiltonians, which limits the class of models that can be…
Photonic computing promises energy-efficient acceleration for optimization and learning, yet discrete combinatorial search and continuous function approximation have largely required distinct devices and control stacks. Here we unify…
We study classical Ising spin-$\frac{1}{2}$ models on the 2D square lattice with ferromagnetic or antiferromagnetic nearest-neighbor interactions, under the effect of a pure imaginary magnetic field. The complex Boltzmann weights of spin…
Photonic solvers that are able to find the ground states of different spin Hamiltonians can be used to study many interactive physical systems and combinatorial optimization problems. Here, we establish a real-and-momentum space…
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…
The presence of long-range quantum spin correlations underlies a variety of physical phenomena in condensed matter systems, potentially including high-temperature superconductivity. However, many properties of exotic strongly correlated…
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…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
We develop a recently-proposed mapping of the two-dimensional Ising model with random exchange (RBIM), via the transfer matrix, to a network model for a disordered system of non-interacting fermions. The RBIM transforms in this way to a…
Physics-inspired computing paradigms, such as Ising machines, are emerging as promising hardware alternatives to traditional von Neumann architectures for tackling computationally intensive combinatorial optimization problems (COPs). While…
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…
Parity-time ($PT$) symmetric Hamiltonians are generally non-Hermitian and give rise to exotic behaviour in quantum systems at exceptional points, where eigenvectors coalesce. The recent realisation of $PT$-symmetric Hamiltonians in quantum…
A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical…
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…