Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.
Quantum Monte Carlo (QMC) algorithms are among the most powerful classical methods for simulating quantum systems, yet their accuracy is often limited by the systematic errors in the approximations used, such as Trotterization. Here we introduce randomly compiled quantum Monte Carlo (RC-QMC) as a general framework that suppresses these systematic errors by averaging over a family of approximations rather than relying on a single fixed one. This strategy is grounded in the concept of randomized compiling from quantum computing, which suppresses errors by sampling over quantum gates, at essentially no additional computational cost. Consequently, our framework achieves a computational advantage over standard QMC methods when estimating a target state to a desired level of accuracy. We illustrate this advantage on two key Monte Carlo algorithms: (1) path integral quantum Monte Carlo for estimating thermal states, and (2) the quantum trajectories method for simulating open system dynamics. In aggregate, these results represent a cross-fertilization of quantum and classical algorithms, are readily generalizable to other QMC methods, and suggest wider applications in classical simulation.
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 (QMC) methods are essential for the numerical study of large-scale quantum many-body systems, yet their utility has been significantly hampered by the difficulty in computing key quantities such as off-diagonal operators and entanglement. This Letter introduces Bell-QMC, a novel QMC framework leveraging Bell sampling, a two-copy measurement protocol in the transversal Bell basis. We demonstrate that Bell-QMC enables an efficient and unbiased estimation of both challenging classes of observables, offering a significant advantage over previous QMC approaches. Notably, the entanglement across all system partitions can be computed in a single Bell-QMC simulation. We implement this method within the stochastic series expansion, where we design an efficient update scheme for sampling the configurations in the Bell basis. We demonstrate our algorithm in the one-dimensional transverse-field Ising model and the two-dimensional Z_{2} lattice gauge theory, extracting universal quantum features using only simple diagonal measurements. This Letter establishes Bell-QMC as a powerful framework that significantly expands the accessible quantum properties in QMC simulations, providing a substantial advantage over conventional QMC.
This paper presents a novel approach to simulating quantum computing algorithms using Monte Carlo methods, specifically designed to account for the inherent probabilistic nature of quantum systems. Traditional simulation methods often rely on deterministic models, which fail to capture the fundamental uncertainty associated with quantum mechanics. Our method employs a stochastic simulation engine that accurately models the probabilistic behavior of quantum gates and measurements. The core of the approach involves generating a large number of samples, each representing a possible outcome of a quantum computation. By analyzing the statistical distribution of these samples, we can approximate the expected results of the algorithm. This technique offers a practical way to evaluate the performance of quantum algorithms, especially those with high levels of uncertainty, and provides a valuable tool for algorithm design and optimization. The method avoids the limitations of purely deterministic simulations and offers a more realistic representation of quantum computation. Key aspects include the development of a robust sampling strategy and the efficient calculation of probabilities. The approach is demonstrated through a detailed explanation and illustrative examples, focusing on the conceptual framework and the underlying mathematical principles.
… a general method, suitable for electronic computing machines, of calculating the properties of any substance which may be considered as composed of interacting individual molecules. N. Metropolis et al. , 1953 Summary Quantum Monte Carlo methods have been very useful in providing exact results, or, at least, exact constraints on properties of electronic systems, in particular for the homogeneous electron gas. The results are, in many cases, more accurate than those from other quantum many-body methods, and provide unique capabilities and insights. In this chapter we introduce the general properties of stochastic methods and motivate their use on the quantum many-body problem. In particular, we discuss Markov chains and the computation of error estimates. The methods that we introduce in the next four chapters are quite different from those in Parts II and III: stochastic or quantum Monte Carlo methods. In stochastic methods, instead of solving deterministically for properties of the quantum many-body system, one sets up a random walk that samples for the properties. Historically the most important role of QMC for the electronic structure field has been to provide input into the other methods, most notably the QMC calculation of the HEG [109], used for the exchange– correlation functional in DFT. A second important role has been as benchmarks for other methods such asGW. There are systems for which QMC is uniquely suited, for example the Wigner transition in the low-density electron gas, see Sec. 3.1. In this chapter we introduce general properties of simulations, in particular Markov chains, and error estimates. In the following chapters we will apply this theory to three general classes of quantum Monte Carlo algorithms, namely variational (Ch. 23), projector (Ch. 24), and path-integral Monte Carlo (Ch. 25); Ch. 18 already introduced the QMC calculation of the impurity Green's function used in the dynamical mean-field method.We note that there are a variety of other QMC methods not covered in this book. Simulations First let us define what we mean by a simulation, since the word has other meanings in applied science. The dimensionality of phase space (i.e., the Hilbert space for a quantum system) is large or infinite. Even a classical system requires the positions and momenta of all particles, and, hence, the phase space for N classical particles has dimensionality 6 N .
We extend Quantum Computing Quantum Monte Carlo (QCQMC) beyond ground-state energy estimation by systematically constructing the quantum circuits used for state preparation. Replacing the original Variational Quantum Eigensolver (VQE) prescription with task-adapted unitaries, we show that QCQMC can address excited-state spectra via Variational Fast Forwarding and the Variational Unitary Matrix Product Operator (VUMPO), combinatorial optimization via a symmetry-preserving VQE ansatz, and finite-temperature observables via Haar-random unitaries. Benchmarks on molecular, condensed-matter, nuclear-structure, and graph-optimization problems demostrate that the QMC diffusion step consistently improves the energy accuracy of the underlying state-preparation method across all tested domains. For weakly correlated systems, VUMPO achieves near-exact energies with significantly shallower circuits by offloading optimization to a classical tensor-network pre-training step, while for strongly correlated systems, the QMC correction becomes essential. We further provide a proof-of-concept demonstration that Haar-random basis state preparation within QCQMC yields finite-temperature estimates from pure-state dynamics.
Quantum Monte Carlo (QMC) methods represent a powerful family of computational techniques for tackling complex quantum many-body problems and performing calculations of stationary state properties. QMC is among the most accurate and powerful approaches to the study of electronic structure, but its application is often hindered by a steep learning curve; hence it is rarely addressed in undergraduate and postgraduate classes. This tutorial is a step toward filling this gap. We offer an introduction to the diffusion Monte Carlo (DMC) method, which aims to solve the imaginary time Schrödinger equation through stochastic sampling of the configuration space. Starting from the theoretical foundations, the discussion leads naturally to the formulation of a step-by-step algorithm. To illustrate how the method works in simplified scenarios, examples such as the harmonic oscillator and the hydrogen atom are provided. The discussion extends to the fixed-node approximation, a crucial approach for addressing the fermionic sign problem in multi-electron systems. In particular, we examine the influence of trial wave function nodal surfaces on the accuracy of DMC energy by evaluating results from a non-interacting two-fermion system. Extending the method to excited states is feasible in principle, but some additional considerations are needed, supported by practical insights. By addressing the fundamental concepts from a hands-on perspective, we hope this tutorial will serve as a valuable guide for researchers and students approaching DMC for the first time.