Related papers: Simulating the All-Order Strong Coupling Expansion…

A worm algorithm is proposed for the two-dimensional spin glasses. The method is based on a low-temperature expansion of the partition function. The low-temperature configurations of the spin glass on square lattice can be viewed as strings…

We perform simulations of random Ising models defined over small-world networks and we check the validity and the level of approximation of a recently proposed effective field theory. Simulations confirm a rich scenario with the presence of…

The strong-coupling character expansion of lattice models is reanalyzed in the perspective of its complete algorithmization. The geometric problem of identifying, counting, and grouping together all possible contributions is disentangled…

The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…

We propose an algorithm to obtain numerically approximate solutions of the direct Ising problem, that is, to compute the free energy and the equilibrium observables of spin systems with arbitrary two-spin interactions. To this purpose we…

In this Letter we propose a new method to infer the topology of the interaction network in pairwise models with Ising variables. By using the pseudolikelihood method (PLM) at high temperature, it is generally possible to distinguish between…

We present a new way to make Ising machines, i.e., using networks of coupled self-sustaining nonlinear oscillators. Our scheme is theoretically rooted in a novel result that establishes that the phase dynamics of coupled oscillator systems,…

As the particle count escalates, the computational demands of diverse simulation algorithms surge, paralleled by a marked enhancement in accuracy. The question arises whether this heightened precision asymptotically dwindles towards zero or…

We present a Markov-chain Monte Carlo algorithm of "worm"type that correctly simulates the O(n) loop model on any (finite and connected) bipartite cubic graph, for any real n>0, and any edge weight, including the fully-packed limit of…

I propose an approximation scheme for asymptotically free field theories combining both weak coupling and strong coupling series. The weak coupling expansion is used to integrate the high frequency modes and the resulting low energy…

In this paper we study the inference of the kinetic Ising model on sparse graphs by the decimation method. The decimation method, which was first proposed in [Phys. Rev. Lett. 112, 070603] for the static inverse Ising problem, tries to…

A strong coupling expansion, based on the Kato-Bloch perturbation theory, which has recently been proposed by Eckardt et al. [Phys. Rev. B 79, 195131] and Teichmann et al. [Phys. Rev. B 79, 224515] is implemented in order to study various…

A general precedure is outlined for an algorithmic implementation of the strong coupling expansion of lattice chiral models on arbitrary lattices. A symbolic character expansion in terms of connected values of group integrals on skeleton…

We apply a new updating algorithm scheme to investigate the critical behavior of the two-dimensional ferromagnetic Ising model on a triangular lattice with nearest neighbour interactions. The transition is examined by generating accurate…

Variational algorithms have gained prominence over the past two decades as a scalable computational environment for Bayesian inference. In this article, we explore tools from the dynamical systems literature to study convergence of…

Tensor network contraction is a fundamental computational challenge underlying quantum many-body physics, statistical mechanics, and machine learning. Belief propagation (BP) provides an efficient approximate solution, but introduces…

We present an error mitigation strategy composed of Echo Verification (EV) and Clifford Data Regression (CDR), the combination of which allows one to learn the effect of the quantum noise channel to extract error mitigated estimates for the…

Recent successes in Monte Carlo methods for simulating fermionic quantum impurity models have been based on diagrammatic resummation techniques, but are restricted by the need to sum over factorially large classes of diagrams individually.…

Using the parallel tempering algorithm and GPU accelerated techniques, we have performed large-scale Monte Carlo simulations of the Ising model on a square lattice with antiferromagnetic (repulsive) nearest-neighbor(NN) and…

The Ising machine is an unconventional computing architecture that can be used to solve NP-hard combinatorial optimization problems more efficiently than traditional von Neumann architectures. Fast, compact oscillator networks which provide…