Related papers: A short-loop algorithm for quantum Monte Carlo sim…
Hamiltonian simulation is one of the most promising paths toward quantum advantage. Most prior approaches to Hamiltonian simulation circuit synthesis focus on local rewrite rules and low-level optimizations, and give limited attention to…
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…
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…
We present a novel Monte Carlo algorithm which enhances equilibrization of low-temperature simulations and allows sampling of configurations over a large range of energies. The method is based on a non-Boltzmann probability weight factor…
We introduce the concept of directed loops in stochastic series expansion and path integral quantum Monte Carlo methods. Using the detailed balance rules for directed loops, we show that it is possible to smoothly connect generally…
We consider the problem of simulating loss probabilities and conditional excesses for linear asset portfolios under the t-copula model. Although in the literature on market risk management there are papers proposing efficient variance…
The Hybrid Monte Carlo (HMC) algorithm currently is the favorite scheme to simulate quantum chromodynamics including dynamical fermions. In this talk-which is intended for a non-expert audience--I want to bring together methodical and…
The linked cell list algorithm is an essential part of molecular simulation software, both molecular dynamics and Monte Carlo. Though it scales linearly with the number of particles, there has been a constant interest in increasing its…
We present a new algorithm for quantum Monte Carlo simulation based on global updating with loops. While various theoretical predictions are confirmed in one dimension, we find, for S=1 systems on a square lattice with an antiferromagnetic…
The many-body dynamics of a quantum computer can be reduced to the time evolution of non-interacting quantum bits in auxiliary fields by use of the Hubbard-Stratonovich representation of two-bit quantum gates in terms of one-bit gates. This…
We present and apply a general-purpose, multi-start algorithm for improving the performance of low-energy samplers used for solving optimization problems. The algorithm iteratively fixes the value of a large portion of the variables to…
This paper proposes a method of quantum Monte Carlo integration that retains the full quadratic quantum advantage, without requiring any arithmetic or quantum phase estimation to be performed on the quantum computer. No previous proposal…
It has been shown that the Metropolis algorithm can be implemented on quantum computers in a way that avoids the sign problem. However, flat histogram techniques are often preferred as they don't suffer from the same limitations that…
We implement a cluster-update Monte Carlo algorithm to simulate magnetic dipoles of the XY-spin type confined in a two-dimensional plane. The long-range character and anisotropy in the dipole interaction are handled by using the…
We introduce a new Monte Carlo method for pure gauge theories. It is not intended for use with dynamical fermions. It belongs to the class of Local Hybrid Monte Carlo (LHMC) algorithms, which make use of the locality of the action by…
The multisilce method is an important algorithm for electron diffraction and image simulations in transmission electron microscopy. We have proposed a quantum algorithm of the multislice method based on quantum circuit model previously. In…
Current quantum simulators suffer from multiple limitations such as short coherence time, noisy operations, faulty readout and restricted qubit connectivity in some platforms. Variational quantum algorithms are the most promising approach…
We show how the worldline quantum Monte Carlo procedure, which usually relies on an artificial time discretization, can be formulated directly in continuous time, rendering the scheme exact. For an arbitrary system with discrete Hilbert…
We apply the event-chain Monte Carlo algorithm to classical continuum spin models on a lattice and clarify the condition for its validity. In the two-dimensional XY model, it outperforms the local Monte Carlo algorithm by two orders of…
In this work, we introduce three algorithmic improvements to reduce the cost and improve the scaling of orbital space variational Monte Carlo (VMC). First, we show that by appropriately screening the one- and two-electron integrals of the…