Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 165

The DOI matches its Crossref record.

Fewest-switches with time uncertainty: A modified trajectory surface-hopping algorithm with better accuracy for classically forbidden electronic transitions

Jasper, Ahren W., Stechmann, Samuel N., Truhlar, Donald G.·2002·The Journal of Chemical Physics

Abstract

We present a modification of Tully’s fewest-switches (TFS) trajectory surface-hopping algorithm (also called molecular dynamics with quantum transitions) that is called the fewest-switches with time uncertainty (FSTU) method. The FSTU method improves the self-consistency of the fewest-switches algorithm by incorporating quantum uncertainty into the hopping times of classically forbidden hops. This uncertainty allows an electronic transition that is classically forbidden at some geometry to occur by hopping at a nearby classically allowed geometry if an allowed hopping point is reachable within the Heisenberg interval of time uncertainty. The increased accuracy of the FSTU method is verified using a challenging set of three-body, two-state test cases for which accurate quantum-mechanical results are available. The FSTU method is shown to be more accurate than the TFS method in predicting total nonadiabatic quenching probabilities and product branching ratios.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1063/1.1453404

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 165

Metadata

Authors
Jasper, A. W., Stechmann, S. N., & Truhlar, D. G.
Venue
The Journal of Chemical Physics
Published
2002-04-01
Volume
116
Issue
13
Pages
5424-5431
ISSN
  • 0021-9606 (ISSN-L)
  • 1089-7690
OpenAlex
W1992854948
Cited by
165
References
0
FWCI
4.25
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: Fewest-switches with time uncertainty: A modified trajectory surface-hopping algorithm with better accuracy for classically forbidden electronic transitions. https://app.cochat.ai/papers/10.1063/1.1453404
The paper
Jasper, A. W., Stechmann, S. N., & Truhlar, D. G. (2002). Fewest-switches with time uncertainty: A modified trajectory surface-hopping algorithm with better accuracy for classically forbidden electronic transitions. The Journal of Chemical Physics. https://doi.org/10.1063/1.1453404

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.