相关论文: The sign problem in full configuration interaction…
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…
Quantum computing offers an alternative paradigm for addressing combinatorial optimization problems compared to classical computing. Despite recent hardware improvements, the execution of empirical quantum optimization experiments at scales…
We present the algorithmic details of the dynamical cluster approximation (DCA), with a quantum Monte Carlo (QMC) method used to solve the effective cluster problem. The DCA is a fully-causal approach which systematically restores non-local…
Quantum many-body problems are some of the most challenging problems in science and are central to demystifying some exotic quantum phenomena, e.g., high-temperature superconductors. The combination of neural networks (NN) for representing…
Monte Carlo studies involving real time dynamics are severely restricted by the sign problem that emerges from highly oscillatory phase of the path integral. In this letter, we present a new method to compute real time quantities on the…
The entanglement entropy probing novel phases and phase transitions numerically via quantum Monte Carlo has made great achievements in large-scale interacting spin/boson systems. In contrast, the numerical exploration in interacting fermion…
In this paper we compare numerical results for the ground state of the Hubbard model obtained by Quantum-Monte-Carlo simulations with results from exact and stochastic diagonalizations. We find good agreement for the ground state energy and…
Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum…
Many problems of practical interest rely on Continuous-time Markov chains~(CTMCs) defined over combinatorial state spaces, rendering the computation of transition probabilities, and hence probabilistic inference, difficult or impossible…
In this article we study examples of systematic biases that can occur in quantum Monte Carlo methods due to the accumulation of non-linear expectation values, and approaches by which these errors can be corrected. We begin with a study of…
We identify and rectify a crucial source of bias in the initiator FCIQMC algorithm. Non-initiator determinants (i.e. determinants whose population is below the initiator threshold) are subject to a systematic {\em undersampling} bias, which…
We present in detail the recently developed multi-configurational symmetrized projector quantum Monte Carlo (MSPQMC) method for excited states of the Hubbard model. We describe the implementation of the Monte Carlo method for a…
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…
The Monte Carlo evaluation of path integrals is one of a few general purpose methods to approach strongly coupled systems. It is used in all branches of Physics, from QCD/nuclear physics to the correlated electron systems. However, many…
In the absence of a fermion sign problem, auxiliary field (or determinantal) quantum Monte Carlo (DQMC) approaches have long been the numerical method of choice for unbiased, large-scale simulations of interacting many-fermion systems. More…
We introduce a black-box auxiliary field quantum Monte Carlo (AFQMC) approach to perform highly accurate electronic structure calculations using configuration interaction singles and doubles (CISD) trial states. This method consistently…
We develop a systematic self-consistent perturbative expansion for the self energy of Hubbard-like models. The interaction lines in the Feynman diagrams are dynamically screened by the charge fluctuations in the system. Although the formal…
We study signal processing tasks in which the signal is mapped via some generalized time-frequency transform to a higher dimensional time-frequency space, processed there, and synthesized to an output signal. We show how to approximate such…
Monte Carlo simulations are useful tools for modeling quantum systems, but in some cases they suffer from a sign problem, leading to an exponential slow down in their convergence to a value. While solving the sign problem is generically…
We investigate the minus-sign problem that afflicts quantum Monte Carlo (QMC) simulations of frustrated quantum spin systems, focusing on spin S=1/2, two spatial dimensions, and the extended Shastry-Sutherland model. We show that…