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.
The most successful solution technique for the Boltzmann transport equation over the past few decades has been the ensemble Monte Carlo technique. This approach is based on converting the equation into a path integral, which is now susceptible to the use of random number techniques with weightings based on the nature of the physical processes involved. When one works with a Monte Carlo procedure for the Boltzmann equation, this equation is transformed into a path integral equation, which forms the basis for the subsequent Monte Carlo evaluation. In quantum information theory, entanglement has a precise definition, and a composite system is said to be in a non-entangled state, if its density matrix can be written as a linear combination of tensor products of sub-system density matrices. The most studied quantum device is the resonant-tunneling diode, in which a quantum well is bounded by two tunnel barriers, with the entire structure placed between two normal semiconductor layers.
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.
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.