The DOI matches its Crossref record.
Critical appraisal of the fewest switches algorithm for surface hopping
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Recent Advances and Perspectives on Nonadiabatic Mixed Quantum–Classical Dynamics
Crespo-Otero, R., & Barbatti, M. (2018) · Chemical Reviews · doi:10.1021/acs.chemrev.7b00577 · Cited by 733
Nonadiabatic Excited-State Molecular Dynamics: Modeling Photophysics in Organic Conjugated Materials
Nelson, T., Fernandez-Alberti, S., Roitberg, A. E., & Tretiak, S. (2014) · Accounts of Chemical Research · doi:10.1021/ar400263p · Cited by 258
Multireference Electron Correlation Methods: Journeys along Potential Energy Surfaces
Park, J. W., Al-Saadon, R., MacLeod, M. K., Shiozaki, T., & Vlaisavljevich, B. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00496 · Cited by 155
Marchetti, B., & Karsili, T. N. V. (2016) · Physical Chemistry Chemical Physics · doi:10.1039/c5cp06767g · Cited by 48
Metadata
- Authors
- Granucci, G., & Persico, M.
- Venue
- The Journal of Chemical Physics
- Publisher
- AIP Publishing
- Published
- 2007-04-05
- Volume
- 126
- Issue
- 13
- Pages
- 134114-134114
- ISSN
- 0021-9606 (ISSN-L)
- 1089-7690
- OpenAlex
- W2092516834
- Cited by
- 721
- References
- 0
- FWCI
- 6.31
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Critical appraisal of the fewest switches algorithm for surface hopping. https://app.cochat.ai/papers/10.1063/1.2715585
- The paper
- Granucci, G., & Persico, M. (2007). Critical appraisal of the fewest switches algorithm for surface hopping. The Journal of Chemical Physics. https://doi.org/10.1063/1.2715585
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.