Related papers: Optimality and annealing path planning of dynamica…
We discuss a general formalism that allows study of transitions over barriers in spin glasses with long-range interactions that contain large but finite number, $N$, of spins. We apply this formalism to the Sherrington-Kirkpatrick model…
Physical annealing systems provide heuristic approaches to solving NP-hard Ising optimization problems. Here, we study the performance of two types of annealing machines--a commercially available quantum annealer built by D-Wave Systems,…
We show that the only solutions of the TAP equations for the Sherrington-Kirkpatrick model of Ising spin glasses which can be found by iteration are those whose free energy lies on the border between replica symmetric and broken replica…
Ising Machines are emerging hardware architectures that efficiently solve NP-Hard combinatorial optimization problems. Generally, combinatorial problems are transformed into quadratic unconstrained binary optimization (QUBO) form, but this…
Experiments on disordered alloys suggest that spin glasses can be brought into low-energy states faster by annealing quantum fluctuations than by conventional thermal annealing. Due to the importance of spin glasses as a paradigmatic…
Quantum annealing is a computational paradigm in which optimisation problems are mapped onto the energy landscape of an interacting quantum system and explored through its dynamical evolution. By continuously transforming a simple initial…
The Path Integral Monte Carlo simulated Quantum Annealing algorithm is applied to the optimization of a large hard instance of the Random 3-SAT Problem (N=10000). The dynamical behavior of the quantum and the classical annealing are…
Quantum annealing offers a promising strategy for solving complex optimization problems by encoding the solution into the ground state of a problem Hamiltonian. While most implementations rely on spin-$1/2$ systems, we explore the…
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising…
We study in detail the quantum Sherrington-Kirkpatrick (SK) model, i.e. the infinite-range Ising spin glass in a transverse field, by solving numerically the effective one-dimensional model that the quantum SK model can be mapped to in the…
A pivotal task for quantum computing is to speed up solving problems that are both classically intractable and practically valuable. Among these, combinatorial optimization problems have attracted tremendous attention due to their broad…
The spherical p-spin model is not only a fundamental model in statistical mechanics of disordered system, but has recently gained popularity since many hard problems in machine learning can be mapped on it. Thus the study of the out of…
We consider social systems in which agents are not only characterized by their states but also have the freedom to choose their interaction partners to maximize their utility. We map such systems onto an Ising model in which spins are…
A mean-field model of Ising spin glass with the Hamiltonian being a sum of the infinite-range ferromagnetic and random antiferromagnetic interactions is studied. It is shown that this model has phase transition in external magnetic field…
Ising machines (IMs) are specialized devices designed to efficiently solve combinatorial optimization problems (COPs). They consist of artificial spins that evolve towards a low-energy configuration representing a problem's solution. Most…
Ising machines are physical platforms designed to minimize the energy of classical Ising Hamiltonians, yet accessing specific excited states remains an open challenge of both fundamental and practical relevance. In this letter we show that…
We perform exact diagonalization and time evolution of the Lechner-Hauke-Zoller (LHZ) annealing architecture [Science Advances 1(9), e1500838 (2015)] for ten physical qubits. Thereby, on a training set consisting of $2400$ problem…
Aim of this work is not trying to explore a macroscopic behavior of some recent model in statistical mechanics but showing how some recent techniques developed within the framework of spin glasses do work on simpler model, focusing on the…
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…
We present a modified simulated annealing method with a dynamical choice of the cooling temperature. The latter is determined via a closed-loop control and is proven to yield exponential decay of the entropy of the particle system. The…