We investigate the convergence of iterative quantum-classical path integral calculations in sluggish environments strongly coupled to a quantum system. The number of classical trajectories, thus the computational cost, grows rapidly (exponentially, unless filtering techniques are employed) with the memory length included in the calculation. We argue that the choice of the (single) trajectory branch during the time preceding the memory interval can significantly affect the memory length required for convergence. At short times, the trajectory branch associated with the reactant state improves convergence by eliminating spurious memory. We also introduce an instantaneous population-based probabilistic scheme which introduces state-to-state hops in the retained pre-memory trajectory branch, and which is designed to choose primarily the trajectory branch associated with the reactant at early times, but to favor the product state more as the reaction progresses to completion. Test calculations show that the dynamically consistent state hopping scheme leads to accelerated convergence and a dramatic reduction of computational effort.
ASJC Scopus subject areas
- Physics and Astronomy(all)
- Physical and Theoretical Chemistry