Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Communications in Theoretical Physics

Evaluation of the Boltzmann Density Matrix with Coupling Term by Monte Carlo Random Walk Method

Jing-Dong Bao, Yizhong Zhuo, Xizhen Wu

Published Dec 1, 1992• 1 citation
Publisher

Abstract

A Monte Carlo random walk algorithm for evaluating the path integral expression for coordinate matrix elements of the Boltzmann operator with the coupling term is suggested and discussed.
DOI
10.1088/0253-6102/18/4/471

Related papers

Small matrix path integral in imaginary time

Rapti Pal, Nancy Makri

Thermal equilibrium properties are usually obtained from the imaginary-time path integral representation of the Boltzmann operator in combination with Monte Carlo integration methods. In some situations (identical fermions or frustrated Hamiltonians), the Boltzmann matrix leads to terms of alternating sign, which leads to a sign problem that severely impacts convergence. In this paper, we develop a robust and efficient quadrature-based method suitable for computing the Boltzmann matrix for discrete systems coupled to common or local harmonic baths. By expressing the discretized path integral with the influence functional in terms of a sum of matrix products, we develop a small matrix path integral (SMatPI) decomposition that allows iterative propagation in imaginary time while circumventing the storage of tensors employed in earlier work. The method is illustrated with several examples that involve two- and three-level systems coupled to common or local baths. We show that cyclic tight-binding Hamiltonians with positive coupling parameters give rise to Boltzmann matrix elements with alternating signs, presenting a severe sign problem to Monte Carlo approaches, while the SMatPI algorithm is stable and efficient.

The Journal of Chemical Physics•Sep 28, 2025•4 citations

A Monte Carlo method for quantum Boltzmann statistical mechanics

Jimmie D. Doll, David L. Freeman

An alternate approach to quantum Boltzmann statistical mechanics in calculations on interacting many-body systems is presented in the form of the Monte-Carlo method. (AIP)

The Journal of Chemical Physics•Mar 1, 1984•77 citations

Projector quantum Monte Carlo

Richard M. Martin, Lucia Reining, David M. Ceperley

… as suggested by Fermi, the time-independent Schrödinger equation … can be interpreted as describing the behavior of a system of particles each of which performs a random walk, i.e., diffuses isotropically and at the same time is subject to multiplication, which is determined by the value of the point function V. N. Metropolis and S. Ulam, 1949 Summary In the projector quantum Monte Carlo method, one uses a function of the hamiltonian to sample a distribution proportional to the exact ground-state wavefunction, and thereby computes exact matrix elements of it. An importance sampling transformation makes the algorithm much more efficient. In this chapter we introduce and develop the diffusion Monte Carlo method, which involves drifting, branching random walks. For any excited state, including any system with more than two electrons, one encounters the sign problem, limiting the direct application of these algorithms for most fermion systems. Instead, by using approximate fixed-node or fixed-phase boundary conditions, one can achieve efficiency similar to variational Monte Carlo. We also discuss the application of the projector method in a basis of Slater determinants. In this chapter, we discuss a different quantum Monte Carlo method, projector Monte Carlo (PMC). This general method was first suggested by Fermi [1049]; see the quote at the start of this chapter by two of the inventors of the Monte Carlo method. An implementation of PMC was tried out in the early days of computing [1050]. Advances in methodology, in particular importance sampling, resulted in a significant large-scale application: the exact calculation of the ground-state properties of 256 hard-sphere bosons by Kalos, Levesque, and Verlet [1051] in 1974. Calculations for electronic systems and the fixednode approximation were introduced by Anderson [1052, 1053]. One of the most important projector MC algorithms, the diffusion Monte Carlo algorithm with importance sampling for fermions, was used to compute the correlation energy of homogeneous electron gas by Ceperley and Alder [109] in 1980; the resulting HEG correlation energy was crucial in the development of density functional calculations. Types and properties of projectors In this method, a many-body projector G ( R , R ) = Ĝ is repeatedly applied to filter out the exact many-body ground state from an initial state; the operation of the projector is carried out with a random walk, hence the name of this class of methods.

Cambridge University Press eBooks•May 31, 2016•0 citations

Partition Function and Density Matrix Path Integral Representation

Lukong Cornelius Fai

For now, let us proceed in the evaluation of the density matrix via the functional integration in a similar manner as we did for the transition amplitude.

CRC Press eBooks•Feb 19, 2021•0 citations

Interfacing Branching Random Walks with Metropolis Sampling: Constraint Release in Auxiliary-Field Quantum Monte Carlo

Zhi-Yu Xiao, Hao Shi, Shiwei Zhang

We present an approach to interface branching random walks with Markov chain Monte Carlo sampling and to switch seamlessly between the two. The approach is discussed in the context of auxiliary-field quantum Monte Carlo (AFQMC) but can be applied to other Monte Carlo calculations or simulations. In AFQMC, the formulation of branching random walks along imaginary-time is needed to realize a constraint to control the sign or phase problem. The constraint is derived from an exact gauge condition and is in practice implemented approximately with a trial wave function or trial density matrix, which can break exactness in the algorithm. We use the generalized Metropolis algorithm to sample a selected portion of the imaginary-time path after it has been produced by the branching random walk. This interfacing allows a constraint release to follow seamlessly from constrained-path sampling, which can reduce the systematic error from the latter. It also provides a way to improve the computation of correlation functions and observables that do not commute with the Hamiltonian. We illustrate the method in atoms and molecules, where improvements in accuracy can be clearly quantified and near-exact results are obtained. We also discuss the computation of the variance of the Hamiltonian and propose a convenient way to evaluate it stochastically without changing the scaling of AFQMC.

arXiv:2305.09575•Journal of Chemical Theory and Computation•Sep 4, 2023•10 citations

Numerical path integration with Coulomb potential

Jan Myrheim

A simple and efficient method for quantum Monte Carlo simulation is presented, based on discretization of the action in the path integral, and a Gaussian averaging of the potential, which works well e.g. with the Coulomb potential.

arXiv:physics/0306168•Jun 24, 2003•1 citation
Thermal equilibrium properties are usually obtained from the imaginary-time path integral representation of the Boltzmann operator in combination with Monte Carlo integration methods. In some situations (identical fermions or frustrated Hamiltonians), the Boltzmann matrix leads to terms of alternating sign, which leads to a sign problem that severely impacts convergence. In this paper, we develop a robust and efficient quadrature-based method suitable for computing the Boltzmann matrix for discrete systems coupled to common or local harmonic baths. By expressing the discretized path integral with the influence functional in terms of a sum of matrix products, we develop a small matrix path integral (SMatPI) decomposition that allows iterative propagation in imaginary time while circumventing the storage of tensors employed in earlier work. The method is illustrated with several examples that involve two- and three-level systems coupled to common or local baths. We show that cyclic tight-binding Hamiltonians with positive coupling parameters give rise to Boltzmann matrix elements with alternating signs, presenting a severe sign problem to Monte Carlo approaches, while the SMatPI algorithm is stable and efficient.
… as suggested by Fermi, the time-independent Schrödinger equation … can be interpreted as describing the behavior of a system of particles each of which performs a random walk, i.e., diffuses isotropically and at the same time is subject to multiplication, which is determined by the value of the point function V. N. Metropolis and S. Ulam, 1949 Summary In the projector quantum Monte Carlo method, one uses a function of the hamiltonian to sample a distribution proportional to the exact ground-state wavefunction, and thereby computes exact matrix elements of it. An importance sampling transformation makes the algorithm much more efficient. In this chapter we introduce and develop the diffusion Monte Carlo method, which involves drifting, branching random walks. For any excited state, including any system with more than two electrons, one encounters the sign problem, limiting the direct application of these algorithms for most fermion systems. Instead, by using approximate fixed-node or fixed-phase boundary conditions, one can achieve efficiency similar to variational Monte Carlo. We also discuss the application of the projector method in a basis of Slater determinants. In this chapter, we discuss a different quantum Monte Carlo method, projector Monte Carlo (PMC). This general method was first suggested by Fermi [1049]; see the quote at the start of this chapter by two of the inventors of the Monte Carlo method. An implementation of PMC was tried out in the early days of computing [1050]. Advances in methodology, in particular importance sampling, resulted in a significant large-scale application: the exact calculation of the ground-state properties of 256 hard-sphere bosons by Kalos, Levesque, and Verlet [1051] in 1974. Calculations for electronic systems and the fixednode approximation were introduced by Anderson [1052, 1053]. One of the most important projector MC algorithms, the diffusion Monte Carlo algorithm with importance sampling for fermions, was used to compute the correlation energy of homogeneous electron gas by Ceperley and Alder [109] in 1980; the resulting HEG correlation energy was crucial in the development of density functional calculations. Types and properties of projectors In this method, a many-body projector G ( R , R ) = Ĝ is repeatedly applied to filter out the exact many-body ground state from an initial state; the operation of the projector is carried out with a random walk, hence the name of this class of methods.
We present an approach to interface branching random walks with Markov chain Monte Carlo sampling and to switch seamlessly between the two. The approach is discussed in the context of auxiliary-field quantum Monte Carlo (AFQMC) but can be applied to other Monte Carlo calculations or simulations. In AFQMC, the formulation of branching random walks along imaginary-time is needed to realize a constraint to control the sign or phase problem. The constraint is derived from an exact gauge condition and is in practice implemented approximately with a trial wave function or trial density matrix, which can break exactness in the algorithm. We use the generalized Metropolis algorithm to sample a selected portion of the imaginary-time path after it has been produced by the branching random walk. This interfacing allows a constraint release to follow seamlessly from constrained-path sampling, which can reduce the systematic error from the latter. It also provides a way to improve the computation of correlation functions and observables that do not commute with the Hamiltonian. We illustrate the method in atoms and molecules, where improvements in accuracy can be clearly quantified and near-exact results are obtained. We also discuss the computation of the variance of the Hamiltonian and propose a convenient way to evaluate it stochastically without changing the scaling of AFQMC.