A "backtracking" correction for the fewest switches surface hopping algorithm

We propose a "backtracking"mechanism within Tully's fewest switches surface hopping (FSSH) algorithm, whereby whenever one detects consecutive (double) hops during a short period of time, one simply rewinds the dynamics backward in time. In doing so, one reduces the number of hopping events and comes closer to a truly fewest switches surface hopping approach with independent trajectories. With this algorithmic change, we demonstrate that surface hopping can be reasonably accurate for nuclear dynamics in a multidimensional configuration space with a complex-valued (i.e., not real-valued) electronic Hamiltonian; without this adjustment, surface hopping often fails. The added computational cost is marginal. Future research will be needed to assess whether or not this backtracking correction can improve the accuracy of a typical FSSH calculation with a real-valued electronic Hamiltonian (that ignores spin).