Related papers: Efficient algorithms for computing ground states o…
We study the three-dimensional gauge glass model in the limit of strong screening by using a minimum cost flow algorithm, enabling us to obtain EXACT ground states for systems of linear size L<=48. By calculating the domain-wall energy, we…
We describe an efficient Monte Carlo algorithm using a random walk in energy space to obtain a very accurate estimate of the density of states for classical statistical models. The density of states is modified at each step when the energy…
The influence of random site dilution on the critical properties of the two-dimensional Ising model on a square lattice was explored by Monte Carlo simulations with the Wang-Landau sampling. The lattice linear size was $L = 20-120$ and the…
We study the ferromagnetic transverse-field Ising model with quenched disorder at $T = 0$ in one and two dimensions by means of stochastic series expansion quantum Monte Carlo simulations using a rigorous zero-temperature scheme. Using a…
Using a recently proposed new renormalization group method (tensor renormalization group), we analyze the Ising model on the 2-dimensional square lattice. For the lowest order approximation with two domain wall states, it realizes the idea…
We study the ground-state (T = 0) morphologies in the d = 3 random-field Ising model (RFIM) using a computationally efficient graph-cut method. We focus on paramagnetic states which arise for disorder strengths \Delta > \Delta c, where…
The two-dimensional Ising model with Brascamp-Kunz boundary conditions has a partition function more amenable to analysis than its counterpart on a torus. This fact is exploited to exactly determine the full finite-size scaling behaviour of…
The quantum phase transitions provide a paradigm for studying collective quantum phenomena that are a result of competing non-commuting interactions. This paper will study the ground state properties and quantum critical dynamics of the…
As a means to solve optimization problems using quantum computers, the problem is typically recast into a Ising spin model whose ground-state is the solution of the optimization problem. An alternative to the Ising formulation is the…
The critical 2-dimensional Ising model is studied with four types boundary conditions: free, fixed ferromagnetic, fixed antiferromagnetic, fixed double antiferromagnetic. Using Bond Propagation algorithms with surface fields, we obtained…
An extension of the projected entangled-pair states (PEPS) algorithm to infinite systems, known as the iPEPS algorithm, was recently proposed to compute the ground state of quantum systems on an infinite two-dimensional lattice. Here we…
The increased dominance of intra-die process variations has motivated the field of Statistical Static Timing Analysis (SSTA) and has raised the need for SSTA-based circuit optimization. In this paper, we propose a new sensitivity based,…
We first present an empirical study of the Belief Propagation (BP) algorithm, when run on the random field Ising model defined on random regular graphs in the zero temperature limit. We introduce the notion of maximal solutions for the BP…
Significant effort in applied quantum computing has been devoted to the problem of ground state energy estimation for molecules and materials. Yet, for many applications of practical value, additional properties of the ground state must be…
In recent years, sequential importance sampling (SIS) has been well developed for sampling contingency tables with linear constraints. In this paper, we apply SIS procedure to 2-dimensional Ising models, which give observations of 0-1…
Monte Carlo methods have led to profound insights into the strong-coupling behaviour of lattice gauge theories and produced remarkable results such as first-principles computations of hadron masses. Despite tremendous progress over the last…
We derive the exact ground-state energy of the one-dimensional Ising model in random fields taking values h, 0 and -h with general probabilities. The random-field Ising model on a ladder is also analyzed by showing its equivalence to the…
Understanding dissipation in 2D quantum many-body systems is a remarkably difficult open challenge. Here we show how numerical simulations for this problem are possible by means of a tensor network algorithm that approximates steady-states…
Combinatorial optimization problems are ubiquitous in industrial applications. However, finding optimal or close-to-optimal solutions can often be extremely hard. Because some of these problems can be mapped to the ground-state search 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…