Related papers: Quantum Monte Carlo determinantal algorithm withou…
A quantum Monte Carlo algorithm for the transverse Ising model with arbitrary short- or long-range interactions is presented. The algorithm is based on sampling the diagonal matrix elements of the power series expansion of the density…
Sampling from complicated probability distributions is a hard computational problem arising in many fields, including statistical physics, optimization, and machine learning. Quantum computers have recently been used to sample from…
Many-body fermionic quantum calculations performed on analog quantum computers are restricted by the presence of k-local terms, which represent interactions among more than two qubits. These originate from the fermion-to-qubit mapping…
Simulation of the time-dynamics of fermionic many-body systems has long been predicted to be one of the key applications of quantum computers. Such simulations -- for which classical methods are often inaccurate -- are critical to advancing…
We show that the two recently proposed methods to compute Renyi entanglement entropies in the realm of determinant quantum Monte Carlo methods for fermions are in principle equivalent, but differ in sampling strategies. The analogy allows…
We present a technique that enables the evaluation of perturbative expansions based on one-loop-renormalized vertices up to large expansion orders. Specifically, we show how to compute large-order corrections to the random phase…
On the base of the diffusion Monte-Carlo method we develop the method allowing to simulate the quantum systems with complex wave function. The method is exact and there are no approximations on the simulations of the module and the phase of…
In low-temperature high-density plasmas quantum effects of the electrons are becoming increasingly important. This requires the development of new theoretical and computational tools. Quantum Monte Carlo methods are among the most…
We numerically analyze the feasibility of a platform-neutral, general strategy to perform quantum simulations of fermionic lattice field theories under open boundary conditions. The digital quantum simulator requires solely one- and…
We investigate the quench of half-filled 1D and 2D fermionic Hubbard models to models without Coulomb interaction. Since the time propagation is gaussian we can use a variety of time-dependent quantum Monte Carlo methods to tackle this…
Recently there have been exciting developments in Monte Carlo methods, with the development of new MCMC and sequential Monte Carlo (SMC) algorithms which are based on continuous-time, rather than discrete-time, Markov processes. This has…
We propose a general framework of quantum kinetic Monte Carlo algorithm, based on a stochastic representation of a series expansion of the quantum evolution. Two approaches have been developed in the context of quantum many-body spin…
It is shown that a class of separately frustration-free (SFF) Hamiltonians can be Monte Carlo simulated efficiently on a classical computing machine, because such an SFF Hamiltonian corresponds to a Gibbs wavefunction whose nodal structure…
We describe a Fourier Accelerated Hybrid Monte Carlo algorithm suitable for dynamical fermion simulations of non-gauge models. We test the algorithm in supersymmetric quantum mechanics viewed as a one-dimensional Euclidean lattice field…
Modeling the dynamics of a quantum system connected to the environment is critical for advancing our understanding of complex quantum processes, as most quantum processes in nature are affected by an environment. Modeling a macroscopic…
Effects of randomness on the spin-1/2 and 1 antiferromagnetic Heisenberg chains are studied using the quantum Monte Carlo method with the continuous-time loop algorithm. We precisely calculated the uniform susceptibility, string order…
A quantum Monte Carlo algorithm is constructed starting from the standard perturbation expansion in the interaction representation. The resulting configuration space is strongly related to that of the Stochastic Series Expansion (SSE)…
We describe an application of variational Monte Carlo to two-dimensional fermionic systems within the recently developed tensor-network string-bond state (SBS) ansatz. We use a combination of variational Monte Carlo and stochastic…
Due to the intrinsic complexity of the quantum many-body problem, quantum Monte Carlo algorithms and their corresponding Monte Carlo configurations can be defined in various ways. Configurations corresponding to few Feynman diagrams often…
A unique feature of the hybrid quantum Monte Carlo (HQMC) method is the potential to simulate negative sign free lattice fermion models with subcubic scaling in system size. Here we will revisit the algorithm for various models. We will…