Related papers: Mitigating the sign problem by quantum computing
We extend the recently introduced phaseless auxiliary-field quantum Monte Carlo (QMC) approach to any single-particle basis, and apply it to molecular systems with Gaussian basis sets. QMC methods in general scale favorably with system…
We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system, made up of three quantum spins with frustrated pair interactions and affected by a hard sign problem…
The sign problem is notorious in Monte Carlo simulations of lattice QCD with the finite density, lattice field theory (LFT) with a $\theta$ term and quantum spin models. In this report, to deal with the sign problem, we apply the maximum…
Quantum Monte Carlo (QMC) methods are one of the most important tools for studying interacting quantum many-body systems. The vast majority of QMC calculations in interacting fermion systems require a constraint to control the sign problem.…
Quantum annealing (QA) is a promising approach for not only solving combinatorial optimization problems but also simulating quantum many-body systems such as those in condensed matter physics. However, non-adiabatic transitions constitute a…
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…
Quantum field theories (QFTs) at finite densities of matter generically involve complex actions. Standard Monte-Carlo simulations based upon importance sampling, which have been producing quantitative first principle results in particle…
We propose new approach to numerical study of quantum spin systems. Our method is based on a fact that one can use any set of states for the path integral as long as it is complete. We apply our method to one-dimensional quantum spin system…
The fermion sign problem, the biggest obstacle in quantum Monte Carlo calculations, is completely solved in this paper. Here, we find a strategy, in which the contribution from those negative-weighted paths is thoroughly cancelled or…
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 discuss the Fermion sign problem and, by examining a very general Hubbard-Stratonovich (HS) transformation, argue that the sign problem cannot be solved with such methods. We propose a different kind of transformation which, while not…
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…
The study of lattice gauge theories with Monte Carlo simulations is hindered by the infamous sign problem that appears under certain circumstances, in particular at non-zero chemical potential. So far, there is no universal method to…
In Monte Carlo simulation, lattice field theory with a $\theta$ term suffers from the sign problem. This problem can be circumvented by Fourier-transforming the topological charge distribution $P(Q)$. Although this strategy works well for…
Quantum Monte Carlo method is applied to fractional quantum Hall systems. The use of the linear programming method enables us to avoid the negative-sign problem in the Quantum Monte Carlo calculations. The formulation of this method and the…
A new method for the stabilization of the sign problem in the Green Function Monte Carlo technique is proposed. The method is devised for real lattice Hamiltonians and is based on an iterative ''stochastic reconfiguration'' scheme which…
We propose a new sampling method to calculate the ground state of interacting quantum systems. This method, which we call the adaptive sampling quantum monte carlo (ASQMC) method utilises information from the high temperature density matrix…
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…
The sign problem is one of the central obstacles to efficiently simulating quantum many-body systems. It is commonly believed that some phases of matter, such as the double semion model, have an intrinsic sign problem and can never be…
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…