Related papers: Simulating the All-Order Strong Coupling Expansion…
We introduce a generalized worldline model where the partition function is a sum over configurations of a conserved flux on a d-dimensional lattice. The weights for the configurations of the corresponding worldlines have factors living on…
With the developed "extended Monte Calro" (EMC) algorithm, we have studied the depinning transition in Ising-type lattice models by extensive numerical simulations, taking the random-field Ising model with a driving field and the driven…
Using D-theory we construct a new efficient cluster algorithm for the Ising model. The construction is very different from the standard Swendsen-Wang algorithm and related to worm algorithms. With the new algorithm we have measured the…
We study the lattice O(2N) Gross-Neveu model with Wilson fermions in the fermion loop formulation. Employing a worm algorithm for an open fermionic string, we simulate fluctuating topological boundary conditions and use them to tune the…
A systematic method to obtain strong coupling expansions for scattering quantities in Hamiltonian lattice field theories is presented. I develop the conceptual ideas by means of the Hamiltonian field theory analogue of the Ising model, in…
The 1+1D Ising model is an ideal benchmark for quantum algorithms, as it is very well understood theoretically. This is true even when expanding the model to include complex coupling constants. In this work, we implement quantum algorithms…
We use the single-cluster Monte Carlo update algorithm to simulate the Ising model on two-dimensional Poissonian random lattices with up to 80,000 sites which are linked together according to the Voronoi/Delaunay prescription. In one set of…
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…
The finite lattice method of series expansion has been used to extend low-temperature series for the partition function, order parameter and susceptibility of the spin-1 Ising model on the square lattice. A new formalism is described that…
Besides its original spin representation, the Ising model is known to have the Fortuin-Kasteleyn (FK) bond and loop representations, of which the former was recently shown to exhibit two upper critical dimensions $(d_c=4,d_p=6)$. Using a…
We propose a new algorithm to learn the network of the interactions of pairwise Ising models. The algorithm is based on the pseudo-likelihood method (PLM), that has already been proven to efficiently solve the problem in a large variety of…
We present an algorithm in which the all-order strong coupling expansion of the Abelian U(1) gauge theory with Wilson plaquette action is sampled. In addition to the vacuum closed surface graphs of the partition function we propose to also…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
The Ising model is a simple statistical model for ferromagnetism. There are analytic solutions for low dimensions and very efficient Monte Carlo methods, such as cluster algorithms, for simulating this model in special cases. However most…
We present a new approach to path integral Monte Carlo (PIMC) simulations based on the worm algorithm, originally developed for lattice models and extended here to continuous-space many-body systems. The scheme allows for efficient…
We propose an efficient Markov Chain Monte Carlo method for sampling equilibrium distributions for stochastic lattice models, capable of handling correctly long and short-range particle interactions. The proposed method is a Metropolis-type…
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…
We use the complex $\phi^4$ field at finite density as a model system for developing further techniques based on worldline formulations of lattice field theories. More specifically we: 1) Discuss new variants of the worm algorithm for…
The Prokof'ev Svistunov worm algorithm was originally developed for models with nearest neighbor interactions that in a high temperature expansion are mapped to systems of closed loops. In this work we present the surface worm algorithm…
We have developed an efficient simulation algorithm for strongly interacting relativistic fermions in two-dimensional field theories based on a formulation as a loop gas. The loop models describing the dynamics of the fermions can be mapped…