Related Experiment Video
Updated: Aug 23, 2026

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
Published on: April 8, 2020
Existence of short-time approximations of any polynomial order for the computation of density matrices by path
1Department of Chemistry, Brown University, Providence, Rhode Island 02912, USA.
Abstract:
In this paper I provide significant mathematical evidence in support of the existence of direct short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and bounded from below potentials. While for Theorem 2, which is "experimental," I only provide a "physicist's" proof, I believe the present development is mathematically sound. As a verification, I explicitly construct two short-time approximations to the density matrix having convergence orders 3 and 4, respectively. Furthermore, in Appendix B, I derive the convergence constant for the trapezoidal Trotter path integral technique. The convergence orders and constants are then verified by numerical simulations. While the two short-time approximations constructed are of sure interest to physicists and chemists involved in Monte Carlo path integral simulations, the present paper is also aimed at the mathematical community, who might find the results interesting and worth exploring. I conclude the paper by discussing the implications of the present findings with respect to the solvability of the dynamical sign problem appearing in real-time Feynman path integral simulations.
Related Concept Videos
Approximate Integration
Applications of Integration to Probability Density Functions
Mean free path and Mean free time
Rationalizing Substitutions
The Uncertainty Principle
Reaction Mechanisms: The Steady-State Approximation
