In this paper the authors address the problem of internal consistency in trajectory surface hopping methods, i.e., the requirement that the fraction of trajectories running on each electronic state equals the probabilities computed by the electronic time-dependent Schrödinger equation, after averaging over all trajectories. They derive a formula for the hopping probability in Tully’s “fewest switches” spirit that would yield a rigorously consistent treatment. They show the relationship of Tully’s widely used surface hopping algorithm with the “exact” prescription that cannot be applied when running each trajectory independently. They also bring out the connection of the consistency problem with the coherent propagation of the electronic wave function and the artifacts caused by coherent Rabi-type oscillations of the state probabilities in weak coupling regimes. A real molecule (azobenzene) and two ad hoc models serve as examples to illustrate the above theoretical arguments. Following a proposal by Truhlar’s group [Zhu et al., J. Chem. Phys. 121, 7658 (2004) Zhu et al., J. Chem. Theory Comput. 1, 527 (2005)], they apply a decoherence correction to the state probabilities, in conjunction with Tully’s algorithm, and they obtain satisfactory results in terms of internal consistency and of agreement with the outcomes of quantum wave packet calculations.
Skip Nav Destination
Article navigation
7 April 2007
Research Article|
April 05 2007
Critical appraisal of the fewest switches algorithm for surface hopping
Giovanni Granucci;
Giovanni Granucci
Dipartimento di Chimica e Chimica Industriale,
Università di Pisa
, via Risorgimento 35, 56126 Pisa, Italy
Search for other works by this author on:
Maurizio Persico
Maurizio Persico
Dipartimento di Chimica e Chimica Industriale,
Università di Pisa
, via Risorgimento 35, 56126 Pisa, Italy
Search for other works by this author on:
J. Chem. Phys. 126, 134114 (2007)
Article history
Received:
January 16 2007
Accepted:
February 15 2007
Citation
Giovanni Granucci, Maurizio Persico; Critical appraisal of the fewest switches algorithm for surface hopping. J. Chem. Phys. 7 April 2007; 126 (13): 134114. https://doi.org/10.1063/1.2715585
Download citation file:
Pay-Per-View Access
$40.00
Sign In
You could not be signed in. Please check your credentials and make sure you have an active account and try again.
Citing articles via
DeePMD-kit v2: A software package for deep potential models
Jinzhe Zeng, Duo Zhang, et al.
CREST—A program for the exploration of low-energy molecular chemical space
Philipp Pracht, Stefan Grimme, et al.
Related Content
Algorithmic decoherence time for decay-of-mixing non–Born–Oppenheimer dynamics
J. Chem. Phys. (July 2008)
A “backtracking” correction for the fewest switches surface hopping algorithm
J. Chem. Phys. (September 2020)
Fewest-switches with time uncertainty: A modified trajectory surface-hopping algorithm with better accuracy for classically forbidden electronic transitions
J. Chem. Phys. (April 2002)
Non-adiabatic dynamics around a conical intersection with surface-hopping coupled coherent states
J. Chem. Phys. (June 2016)
Accuracy of trajectory surface-hopping methods: Test for a two-dimensional model of the photodissociation of phenol
J. Chem. Phys. (November 2017)