This paper discusses some mathematical aspects related to the use of probabilistic techniques in quantum Monte Carlo (QMC) methods from a physicist’s point of view. A selected list of problems and techniques employed in computational physics and of interest to the applied probability community is presented. One of the variants of QMC approaches based on the Feynman-Kac formula is described in some detail. The problem of numerical efficiency at the heart of physical applications defined in (very) high-dimensional space is discussed and the commonly used solution through importance sampling is presented. Finally, the specific constraints related to fermion systems in QMC are presented and the celebrated “fermion sign problem” (considered as one of the most important open problem in computational physics) is discussed.
This paper discusses some mathematical aspects related to the use of probabilistic techniques in quantum Monte Carlo (QMC) methods from a physicist’s point of view. A selected list of problems and techniques employed in computational physics and of interest to the applied probability community is presented. One of the variants of QMC approaches based on the Feynman-Kac formula is described in some detail. The problem of numerical efficiency at the heart of physical applications defined in (very) high-dimensional space is discussed and the commonly used solution through importance sampling is presented. Finally, the specific constraints related to fermion systems in QMC are presented and the celebrated “fermion sign problem” (considered as one of the most important open problem in computational physics) is discussed.
The Monte Carlo method is a powerful scheme to solve many mathematical equations and is in fact, made practical only through high speed computers, particularly for those physical problems that are of high dimensionality. Alternative numerical schemes of spanning high dimensional spaces uniformly with a grid, increase in computational time exponentially with the dimensionality and thus became rapidly impractical as the dimensionality increases. The key to success of a Monte Carlo scheme is that it samples the space selectively, not with some uniform random distribution but where it matters most, by a probability density called an importance function. Furthermore, the Monte Carlo scheme is well adapted to computers since it consists of a simple, highly repetitive algorithm that takes advantage of the fast arithmetic capabilities of the machines. Consideration of how to arrange such calculations efficiently on various machines of different architecture is discussed.
Reliable simulations of correlated quantum systems, including high-temperature superconductors and frustrated magnets, are increasingly desired nowadays to further our understanding of essential features in such systems. Quantum Monte Carlo (QMC) is a unique numerically exact and intrinsically unbiased method to simulate interacting quantum many-body systems. More importantly, when QMC simulations are free from the notorious fermion sign problem, they can reliably simulate interacting quantum models with large system size and low temperature to reveal low-energy physics such as spontaneously broken symmetries and universal quantum critical behaviors. Here, we concisely review recent progress made in developing new sign-problem-free QMC algorithms, including those employing Majorana representation and those utilizing hot-spot physics. We also discuss applications of these novel sign-problem-free QMC algorithms in simulations of various interesting quantum many-body models. Finally, we discuss possible future directions of designing sign-problem-free QMC methods.
A quantum Monte Carlo method is simply a Monte Carlo method applied to a quantum problem. What distinguishes a quantum Monte Carlo method from a classical one is the initial effort necessary to represent the quantum problem in a form that is suitable for Monte Carlo simulation. It is in making this transformation that the quantum nature of the problem asserts itself not only through such obvious issues as the noncommutivity of the physical variables and the need to symmetrize or antisymmetrize the wave function, but also through less obvious issues such as the sign problem. Almost always, the transformation replaces the quantum degrees of freedom by classical ones, and it is to these classical degrees of freedom that the Monte Carlo method is actually applied. Succeeding chapters present and explain many of the quantum Monte Carlo methods being successfully used on a variety of quantum problems. In Chapters 1 and 2 we focus on discussing what the Monte Carlo method is and why it is useful. The Monte Carlo method The Monte Carlo method is not a specific technique but a general strategy for solving problems too complex to solve analytically or too intensive numerically to solve deterministically. Often a specific strategy incorporates several different Monte Carlo techniques. In what is likely the first journal article to use the phrase “Monte Carlo,” Metropolis and Ulam (1949) discuss this strategy. To paraphrase them, The Monte Carlo method is an iterative stochastic procedure, consistent with a defining relation for some function, which allows an estimate of the function without completely determining it. This is quite different from the colloquialism, “a method that uses random numbers.” Let us examine the definition piece by piece. A key point will emerge. Ulam and Metropolis were presenting the motivation and a general description of a statistical approach to the study of differential and integro-differential equations. These equations were their “defining relation for some function.” The “function” was the solution of these equations. This function is of course unknown a priori. Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller (1953) a few years later would propose a statistical approach to the study of equilibrium statistical mechanics. The defining relation there was a thermodynamic average of a physical quantity over the Boltzmann distribution. The function was the physical quantity, and the unknown its average.
For important classes of many-fermion problems, quantum Monte Carlo (QMC) methods allow exact calculations of ground-state and finite-temperature properties without the sign problem. The list spans condensed matter, nuclear physics, and high-energy physics, including the half-filled repulsive Hubbard model, the spin-balanced atomic Fermi gas, and lattice quantum chromodynamics calculations at zero density with Wilson Fermions, and is growing rapidly as a number of problems have been discovered recently to be free of the sign problem. In these situations, QMC calculations are relied on to provide definitive answers. Their results are instrumental to our ability to understand and compute properties in fundamental models important to multiple subareas in quantum physics. It is shown, however, that the most commonly employed algorithms in such situations have an infinite variance problem. A diverging variance causes the estimated Monte Carlo statistical error bar to be incorrect, which can render the results of the calculation unreliable or meaningless. We discuss how to identify the infinite variance problem. An approach is then proposed to solve the problem. The solution does not require major modifications to standard algorithms, adding a "bridge link" to the imaginary-time path integral. The general idea is applicable to a variety of situations where the infinite variance problem may be present. Illustrative results are presented for the ground state of the Hubbard model at half-filling.
In this brief article, I introduce the various types of quantum Monte Carlo (QMC) methods, in particular, those that are applicable to systems in extreme regimes of temperature and pressure.We give references to longer articles where detailed discussion of applications and algorithms appear. MOTIVATIONOne does QMC for the same reason as one does classical simulations; there is no other method able to treat exactly the quantum many-body problem aside from the direct simulation method where electrons and ions are directly represented as particles, instead of as a "fluid" as is done in mean-field based methods.However, quantum systems are more difficult than classical systems because one does not know the distribution to be sampled, it must be solved for.In fact, it is not known today which quantum problems can be "solved" with simulation on a classical computer in a reasonable amount of computer time.One knows that certain systems, such as most quantum many-body systems in 1D and most bosonic systems are amenable to solution with Monte Carlo methods, however, the "sign problem" prevents making the same statement for systems with electrons in 3D.Some limitations or approximations are needed in practice.On the other hand, in contrast to simulation of classical systems, one does know the Hamiltonian exactly: namely charged particles interacting with a Coulomb potential.Given sufficient computer resources, the results can be of quite high quality and for systems where there is little reliable experimental data.For this reason, QMC methods, though more expensive, are useful to benchmark and validate results from other methods.The two main applications that we will discuss in this review are the "electronic structure problem"; computing the energy of the an interacting systems of electrons and fixed ions, and the problem of quantum effects of the nuclei. RANDOM WALK AND MARKOV CHAINSMost QMC algorithms are based on random walks, known mathematically as Markov chains.This is a general class of algorithms, introduced in the famous work by Metropolis, the Rosenbluths and the Tellers (1953) for sampling any probability distribution.Let us denote the desired distribution as Π(S), where the variable "S" represents the state of the walk, for example the coordinates of all of the particles.In a random walk, one invents some moving rules (transition probabilities) for changing the state of the system so that the probability of being in state S n+1 in the (n+1) step, given that the random walk was S n is given by T(S n ; S n+1 ).By
Quantum Monte Carlo methods are a powerful suite of techniques for solving the quantum many-body problem. By using random numbers to stochastically sample quantum properties, QMC methods are capable of studying low-temperature quantum systems well beyond the reach of conventional deterministic techniques. QMC techniques have likewise been indispensible tools for augmenting our current knowledge of superfluidity and superconductivity. In this thesis, I present two new quantum Monte Carlo techniques, the Monte Carlo Power Method and Bose-Fermi Auxiliary-Field Quantum Monte Carlo, and apply previously developed Path Integral Monte Carlo methods to explore two new phases of quantum hard spheres and hydrogen. I lay the foundation for a subsequent description of my research by first reviewing the physics of quantum liquids in Chapter One and the mathematics behind Quantum Monte Carlo algorithms in Chapter Two. I then discuss the Monte Carlo Power Method, a stochastic way of computing the first several extremal eigenvalues of a matrix too memory-intensive to be stored and therefore diagonalized. As an illustration of the technique, I demonstrate how it can be used to determine the second eigenvalues of the transition matrices of several popular Monte Carlo algorithms. This information may be used to quantify how rapidly a Monte Carlo algorithm is converging to the equilibrium probability distribution it is sampling. I next present the Bose-Fermi Auxiliary-Field Quantum Monte Carlo algorithm. This algorithm generalizes the well-known Auxiliary-Field Quantum Monte Carlo algorithm for fermions to bosons and Bose-Fermi mixtures. Despite some shortcomings, the Bose-Fermi Auxiliary-Field Quantum Monte Carlo algorithm represents the first exact technique capable of studying Bose-Fermi mixtures of any size in any dimension. In Chapter Six, I describe a new Constant Stress Path Integral Monte Carlo algorithm for the study of quantum mechanical systems under high pressures. While the eventual hope is to apply this algorithm to the exploration of yet unidentified high-pressure, low-temperature phases of hydrogen, I employ this algorithm to determine whether or not quantum hard spheres can form a low-temperature bcc solid if exchange is not taken into account. In the final chapter of this thesis, I use Path Integral Monte Carlo once again to explore whether glassy para-hydrogen exhibits superfluidity. Physicists have long searched for ways to coax hydrogen into becoming a superfluid. I present evidence that, while glassy hydrogen does not crystallize at the temperatures at which hydrogen might become a superfluid, it nevertheless does not exhibit superfluidity. This is because the average binding energy per p-H2 molecule poses a severe barrier to exchange regardless of whether the system is crystalline. All in all, this work extends the reach of Quantum Monte Carlo methods to new systems and brings the power of existing methods to bear on new problems.