Related papers: Worm-algorithm-type Simulation of Quantum Transver…

We propose a highly efficient "worm" like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the new algorithm even in the presence of disorder. For the…

We demonstrate that a quantum field theory (QFT) in general two-dimensional curved spacetimes can be realized by a system of quantum spins or qubits. We consider a spin-1/2 model on a one-dimensional ring with spatially and temporally…

The fractal dimensions and the percolation exponents of the geometrical spin clusters of like sign at criticality, are obtained numerically for an Ising model with temperature-dependent annealed bond dilution, also known as the thermalized…

We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation [Nature 618, 500 (2023)]. Our approach is based on the projected entangled pair operator (PEPO)…

We prove rapid mixing of the worm process for the zero-field ferromagnetic Ising model, on all finite connected graphs, and at all temperatures. As a corollary, we obtain a fully-polynomial randomized approximation scheme for the Ising…

Recently, Syljuasen and Sandvik proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a…

Here, we investigate the use of deep multi-scale entanglement renormalization (DMERA) circuits as a variational ansatz for ground states of gapless systems. We use the exactly-solvable one-dimensional critical transverse-field Ising model…

We present a dual geometrical worm algorithm for two-dimensional Ising models. The existence of such dual algorithms was first pointed out by Prokof'ev and Svistunov \cite{ProkofevClassical}. The algorithm is defined on the dual lattice and…

Quantum entanglement is a key ingredient for quantum information processing with capabilities beyond that of classical computation. We study the generation and role of entanglement in the dynamics of spin-1/2 models, both for the design of…

We present a new class of algorithms for performing valence-bond quantum Monte Carlo of quantum spin models. Valence-bond quantum Monte Carlo is a T=0 Monte Carlo method based on sampling of a set of operator-strings that can be viewed as…

We present a general strategy to extend quantum cluster algorithms for S=1/2 spin systems, such as the loop algorithm, to systems with arbitrary size of spins. In general, the partition function of a high-S spin system is represented in…

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…

Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…

Working within the stochastic series expansion framework, we introduce and characterize a new quantum cluster algorithm for quantum Monte Carlo simulations of transverse field Ising models with frustrated Ising exchange interactions. As a…

Quantum simulation holds the promise of improving the atomic simulations used at EDF to anticipate the ageing of materials of interest. One simulator in particular seems well suited to modeling interacting electrons: the Rydberg atoms…

We demonstrate that the ``worm'' algorithm allows very effective and precise quantum Monte Carlo (QMC) simulations of spin systems in a magnetic field, and its auto-correlation time is rather insensitive to the value of H at low…

Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In…

The corrections to finite-size scaling in the critical two-point correlation function G(r) of 2D Ising model on a square lattice have been studied numerically by means of exact transfer-matrix algorithms. The systems have been considered,…

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 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…