Related papers: Coarse-grained loop algorithms for Monte Carlo sim…
We present an algorithmic framework for a variant of the quantum Monte Carlo operator-loop algorithm, where non-local cluster updates are constructed in a way that makes each individual loop smaller. The algorithm is designed to increase…
Quantum Monte Carlo algorithms based on a world-line representation such as the worm algorithm and the directed loop algorithm are among the most powerful numerical techniques for the simulation of non-frustrated spin models and of bosonic…
An efficient Quantum Monte Carlo algorithm for the simulation of bosonic systems on a lattice in a grand canonical ensemble is proposed. It is based on the mapping of bosonic models to the spin models in the limit of the infinite total spin…
We develop Monte Carlo methods for sampling random states and corresponding bit strings in qubit systems. To this end, we derive exact probability density functions that yield the Porter-Thomas distribution in the limit of large systems. We…
Generalized rules for building and flipping clusters in the quantum Monte Carlo loop algorithm are presented for the XXZ-model in a uniform magnetic field along the Z-axis. As is demonstrated for the Heisenberg antiferromagnet it is…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
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…
We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path integral representation of the partition function. The code can deal with…
Based on the worm algorithm in the path-integral representation, we propose a general quantum Monte Carlo algorithm suitable for parallelizing on a distributed-memory computer by domain decomposition. Of particular importance is its…
We develop a classical Monte Carlo algorithm based on a quasi-classical approximation for a pseudospin S=1 Hamiltonian in real space to construct a phase diagram of a model cuprate with a high Tc. A model description takes into account both…
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…
Monte Carlo sampling is a powerful toolbox of algorithmic techniques widely used for a number of applications wherein some noisy quantity, or summary statistic thereof, is sought to be estimated. In this paper, we survey the literature for…
The main idea of this work is that the quantum-classical isomorphism is a suitable framework for a generalization of the notion of detailed balance. The quantum-classical isomorphism is used in order to develop a Monte Carlo simulation with…
We investigate in this work a recently proposed diagrammatic quantum Monte Carlo method --- the inchworm Monte Carlo method --- for open quantum systems. We establish its validity rigorously based on resummation of Dyson series. Moreover,…
Quantum spin systems with strong geometric restrictions give rise to rich quantum phases such as valence bond solids and spin liquid states. However, the geometric restrictions often hamper the application of sophisticated numerical…
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…
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…
Monte Carlo algorithms are barely considered in spin foam quantum gravity. Due to the quantum nature of spin foam amplitudes one cannot readily apply them, and the present sign problem is a threat to convergence and thus efficiency. Yet,…
We review efficient Monte Carlo methods for simulating quantum systems which couple to a dissipative environment. A brief introduction of the Caldeira-Leggett model and the Monte Carlo method will be followed by a detailed discussion of…
We present a new quantum Monte Carlo algorithm suitable for generically complex problems, such as systems coupled to external magnetic fields or anyons in two spatial dimensions. We find that the choice of gauge plays a nontrivial role, and…