Related papers: Real-time Sign-Problem-Suppressed Quantum Monte Ca…
We introduce a Quantum Monte Carlo (QMC) method which efficiently simulates in a sign-problem-free way a broad class of frustrated $S=1/2$ models with competing antiferromagnetic interactions. Our scheme uses the basis of total spin…
It is known that quantum computers can speed up Monte Carlo simulation compared to classical counterparts. There are already some proposals of application of the quantum algorithm to practical problems, including quantitative finance. In…
The sign problem is a notorious problem, which occurs in Monte Carlo simulations of a system with a partition function whose integrand is not positive. One way to simulate such a system is to use the factorization method where one enforces…
A continuous-time path integral Quantum Monte Carlo method using the directed-loop algorithm is developed to simulate the Anderson single-impurity model in the occupation number basis. Although the method suffers from a sign problem at low…
We describe a novel simulation method that eliminates the slowing-down problem in the Monte Carlo simulations of imaginary-time path integrals near the continuum limit. This method combines a stochastic blocking procedure with the multigrid…
It is shown that the exact dynamics of a composite quantum system can be represented through a pair of product states which evolve according to a Markovian random jump process. This representation is used to design a general Monte Carlo…
We present a new approach for Monte Carlo simulations of lattice quantum spin systems which is able to eliminate the negative sign problem. Its complexity is linear in the volume of the lattice. Its efficiency is tested on a simple…
Quantum annealing is a generic solver of the optimization problem that uses fictitious quantum fluctuation. Its simulation in classical computing is often performed using the quantum Monte Carlo simulation via the Suzuki--Trotter…
The notorious fermion sign problem, arising from fermion statistics, presents a fundamental obstacle to the numerical simulation of quantum many-body systems. Here, we introduce a framework that circumvents the sign problem in the studies…
Quantum Monte Carlo simulations of quantum many body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time $\beta$ and system size. The sign problem…
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…
In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the system, the environment and their interaction:…
The sign problem in quantum Monte Carlo calculations is analyzed using the meron-cluster solution. The concept of merons can be used to solve the sign problem for a limited class of models. Here we show that the method can be used to…
The possibility to simulate the properties of many-body open quantum systems with a large number of degrees of freedom is the premise to the solution of several outstanding problems in quantum science and quantum information. The challenge…
We develop a recently introduced representation of quantum dynamics based on sampling negative Markov chain processes. By introducing particles and antiparticles, this formalism maps generic quantum dynamics onto a Markov process defined…
The Markov Chain Monte Carlo method is at the heart of efficient approximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is therefore very natural and important to determine whether…
The stochastic-gauge representation is a method of mapping the equation of motion for the quantum mechanical density operator onto a set of equivalent stochastic differential equations. One of the stochastic variables is termed the…
We present a numerically exact Inchworm Monte Carlo method for equilibrium multiorbital quantum impurity problems with general interactions and hybridizations. We show that the method, originally developed to overcome the dynamical sign…
We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its…
Quantum annealing aims to provide a faster method for finding the minima of complicated functions, compared to classical computing, so there is an increasing interest in the relaxation dynamics of quantum spin systems. Moreover, it is known…