相关论文: Quantum Monte Carlo determinantal algorithm withou…
We present a simple derivation of a Feynman-Kac type formula to study fermionic systems. In this approach the real time or the imaginary time dynamics is expressed in terms of the evolution of a collection of Poisson processes. A computer…
We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin-$1/2$ Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear and…
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 discuss a simulation algorithm for dynamical fermions, which combines the multiboson technique with the Hybrid Monte Carlo algorithm. The algorithm turns out to give a substantial gain over standard methods in practical simulations and…
We propose a modification of the Hybrid-Monte-Carlo algorithm that allows for a larger step-size of the integration scheme at constant acceptance rate. The key ingredient is that the pseudo-fermion action is split into two parts. We test…
One of the open challenges in quantum computing is to find meaningful and practical methods to leverage quantum computation to accelerate classical machine learning workflows. A ubiquitous problem in machine learning workflows is sampling…
Given a specific interacting quantum Hamiltonian in a general spatial dimension, can one access its entanglement properties, such as, the entanglement entropy corresponding to the ground state wavefunction? Even though progress has been…
Development of exponentially scaling methods has seen great progress in tackling larger systems than previously thought possible. One such technique, full configuration interaction quantum Monte Carlo, is a useful algorithm that allows…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
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…
Three possibilities to speed up the Hybrid Monte Carlo algorithm are investigated. Changing the step-size adaptively brings no practical gain. On the other hand, substantial improvements result from using an approximate Hamiltonian or a…
The absence of negative sign problem in quantum Monte Carlo simulations of spin and fermion systems has different origins. World-line based algorithms for spins require positivity of matrix elements whereas auxiliary field approaches for…
In this work we present a novel quantum Monte-Carlo method for fermions, based on an exact decomposition of the Boltzmann operator $exp(-\beta H)$. It can be seen as a synthesis of several related methods. It has the advantage that it is…
We give a brief discussion of the recently developed Constrained-Path Monte Carlo Method. This method is a quantum Monte Carlo technique that eliminates the fermion sign problem plaguing simulations of systems of interacting electrons. The…
Simulating quantum many-body systems is a highly demanding task since the required resources grow exponentially with the dimension of the system. In the case of fermionic systems, this is even harder since nonlocal interactions emerge due…
We propose a modification of the Hybrid-Monte-Carlo algorithm that allows for a larger step-size of the integration scheme at constant acceptance rate. The key ingredient is the splitting of the pseudo-fermion action into two parts. We test…
In this paper, we discover a new quantum Monte Carlo (QMC) method to solve the fermion sign problem in interacting fermion models by employing Majorana representation of complex fermions. We call it "Majorana QMC" (MQMC). Especially, MQMC…
Nowadays, quantum simulation schemes come in two flavours. Either they are continuous-time discrete-space models (a.k.a Hamiltonian-based), pertaining to non-relativistic quantum mechanics. Or they are discrete-spacetime models (a.k.a…
Quantum Monte Carlo is one of the most powerful numerical tools for studying nonpeturbative properties of quantum many-body systems. However, its application to real-time problems is limited since the complex and highly-oscillating…
We present a simple trick that allows to consider the sum of all connected Feynman diagrams at fixed position of interaction vertices for general fermionic models. With our approach one achieves superior performance compared to Diagrammatic…