Related papers: On the Sign Problem of the Fermionic Shadow Wave F…
We analyze the accuracy and sample complexity of variational Monte Carlo approaches to simulate the dynamics of many-body quantum systems classically. By systematically studying the relevant stochastic estimators, we are able to: (i) prove…
We develop a Monte Carlo scheme for sampling series of Feynman diagrams for the proper self-energy which are self-consistently expressed in terms of renormalized particle propagators. This approach is used to solve the problem of a single…
We discuss differences and similarities between variational Monte Carlo approaches that use conventional and artificial neural network parameterizations of the ground-state wave function for systems of fermions. We focus on a relatively…
The Worldvolume Hybrid Monte Carlo (WV-HMC) method [arXiv:2012.08468] is an efficient algorithm for addressing the numerical sign problem at moderate computational cost. It mitigates the sign problem while avoiding the ergodicity issues…
Computation of ionic forces using quantum Monte Carlo methods has long been a challenge. We introduce a simple procedure, based on known properties of physical electronic densities, to make the variance of the Hellmann-Feynman estimator…
Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding…
Finding the ground state of a fermionic Hamiltonian using quantum Monte Carlo is a very difficult problem, due to the Fermi sign problem. While still scaling exponentially, full configuration-interaction Monte Carlo (FCI-QMC) mitigates some…
We present a new Monte Carlo method for obtaining solutions of the Boltzmann equation for describing phonon transport in micro and nanoscale devices. The proposed method can resolve arbitrarily small signals (e.g. temperature differences)…
The Green's function Monte Carlo (GFMC) method provides accurate solutions to the nuclear many-body problem and predicts properties of light nuclei starting from realistic two- and three-body interactions. Controlling the GFMC fermion-sign…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
Quantum mechanics for many-body systems may be reduced to the evaluation of integrals in 3N dimensions using Monte-Carlo, providing the Quantum Monte Carlo ab initio methods. Here we limit ourselves to expectation values for trial…
Simulating models for quantum correlated matter unveils the inherent limitations of deterministic classical computations. In particular, in the case of quantum Monte Carlo methods, this is manifested by the emergence of negative weight…
Neural-network variational Monte Carlo (NNVMC) has emerged as a powerful tool for solving quantum many-body problems, yet systematic pathways for improving its accuracy remain largely heuristic. Here, we introduce a physically motivated…
The sign problem is a notorious problem, which occurs in Monte Carlo simulations of a system with the partition function whose integrand is not real positive. The basic idea of the factorization method applied on such a system is to control…
A precise dynamical characterization of quantum impurity models with multiple interacting orbitals is challenging. In quantum Monte Carlo methods, this is embodied by sign problems. A dynamical sign problem makes it exponentially difficult…
Fermionic condensation typically occurs via pairing. In recent decades, however, a fundamental question has emerged: whether alternative forms of order exist, such as condensates of fermion quadruplets. These states--including ``charge-4e"…
Quantum Monte Carlo (QMC) methods can very accurately compute ground state properties of quantum systems. We applied these methods to a system of boson hard spheres to get exact, infinite system size results for the ground state at several…
Current nonequilibrium Monte Carlo methods suffer from a dynamical sign problem that makes simulating real-time dynamics for long times exponentially hard. We propose a new `Inchworm Algorithm', based on iteratively reusing information…
We discuss the sign problem arising in Monte Carlo simulations of frustrated quantum spin systems. We show that for a class of ``semi-frustrated'' systems (Heisenberg models with ferromagnetic couplings $J_z(r) < 0$ along the $z$-axis and…
Towards a solution to the sign problem in the simulations of systems having indefinite or complex-valued measures, we propose a new approach which yields statistical errors smaller than the crude Monte Carlo using absolute values of the…