Related papers: Adaptive Cluster Expansion for Ising spin models
Accurate many-body treatments of condensed-phase systems are challenging because correlated solvers such as full configuration interaction (FCI) and the density matrix renormalization group (DMRG) scale exponentially with system size.…
We show analytically that the perturbative expansion for the free energy of the zero dimensional (quenched) disordered Ising model is Borel-summable in a certain range of parameters, provided that the summation is carried out in two steps:…
After having developed a method that measures real time evolution of quantum systems at a finite temperature, we present here the simplest field theory where this scheme can be applied to, namely the 1+1 Ising model. We will compute the…
We consider a recently introduced generalization of the Ising model in which individual spin strength can vary. The model is intended for analysis of ordering in systems comprising agents which, although matching in their binarity (i.e.,…
We present excitation energies for molecular doublets from a spin-adapted formulation of coupled cluster singles and doubles theory. The entanglement coupled cluster approach represents an unconventional take on the notorious problem of…
We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability. In each case,…
Many iterative and non-iterative methods have been developed for inverse problems associated with Ising models. Aiming to derive an accurate non-iterative method for the inverse problems, we employ the tree-reweighted approximation. Using…
In this paper, we present a cluster algorithm for the numerical simulations of non-additive hard-core mixtures. This algorithm allows one to simulate and equilibrate systems with a number of particles two orders of magnitude larger than…
We present a spin-free, size-extensive, and size-consistent coupled cluster method based on a generalised normal ordered exponential ansatz. This approach is a natural generalisation of single-reference coupled cluster theory for arbitrary…
Spin relaxation in a site-disordered Ising model within master equation approach is studied. The $\vec{q},\omega$-dependent susceptibility of the model is calculated and investigated. Effects described by the two-site cluster approximation…
We demonstrate that a series of procedures for increasing the efficiency of transition matrix calculations can be realized by integrating the standard single-spin flip transition matrix method with global cluster flipping techniques. Our…
Given a complex high-dimensional distribution over $\{\pm 1\}^n$, what is the best way to increase the expected number of $+1$'s by controlling the values of only a small number of variables? Such a problem is known as influence…
We initiate the study of how to extend the correspondence between dimer models and (0+1)-dimensional cluster integrable systems to (1+1) and (2+1)-dimensional continuous integrable field theories, addressing various points that are…
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…
We study Bosonic representation of spin Ising model with the application of simulating two level systems using continuous variable quantum processors. We decompose the time evolution of spin systems into a sequence of continuous variable…
Correlation clustering is a flexible framework for partitioning data based solely on pairwise similarity or dissimilarity information, without requiring the number of clusters as input. However, in many practical scenarios, these pairwise…
In this paper, we present a local information theoretic approach to explicitly learn probabilistic clustering of a discrete random variable. Our formulation yields a convex maximization problem for which it is NP-hard to find the global…
Many combinatorial optimization problems (COPs) are naturally expressed using variables that take on more than two discrete values. To solve such problems using Ising machines (IMs) - specialized analog or digital devices designed to solve…
Simulated annealing (SA) attracts more attention among classical heuristic algorithms because the solution of the combinatorial optimization problem can be naturally mapped to the ground state of the Ising Hamiltonian. However, in practical…
We adapted the SWAP molecular dynamics algorithm for use in lattice Ising spin models. We dressed the spins with a randomly distributed length and we alternated long-range spin exchanges with conventional single spin flip Monte Carlo…