TY - JOUR
T1 - A Robust and Unified Solution for Choosing the Phases of Adiabatic States as a Function of Geometry
T2 - Extending Parallel Transport Concepts to the Cases of Trivial and Near-Trivial Crossings
AU - Zhou, Zeyu
AU - Jin, Zuxin
AU - Qiu, Tian
AU - Rappe, Andrew M.
AU - Subotnik, Joseph Eli
N1 - Publisher Copyright:
Copyright © 2019 American Chemical Society.
PY - 2020/2/11
Y1 - 2020/2/11
N2 - We investigate a simple and robust scheme for choosing the phases of adiabatic electronic states smoothly (as a function of geometry) so as to maximize the performance of ab initio non-adiabatic dynamics methods. Our approach is based upon consideration of the overlap matrix (U) between basis functions at successive points in time and selecting the phases so as to minimize the matrix norm of log(U). In so doing, one can extend the concept of parallel transport to cases with sharp curve crossings. We demonstrate that this algorithm performs well under extreme situations where dozens of states cross each other either through trivial crossings (where there is zero effective diabatic coupling), or through non-trivial crossings (when there is a non-zero diabatic coupling), or through a combination of both. In all cases, we compute the time-derivative coupling matrix elements (or equivalently non-adiabatic derivative coupling matrix elements) that are as smooth as possible. Our results should be of interest to all who are interested in either non-adiabatic dynamics, or more generally, parallel transport in large systems.
AB - We investigate a simple and robust scheme for choosing the phases of adiabatic electronic states smoothly (as a function of geometry) so as to maximize the performance of ab initio non-adiabatic dynamics methods. Our approach is based upon consideration of the overlap matrix (U) between basis functions at successive points in time and selecting the phases so as to minimize the matrix norm of log(U). In so doing, one can extend the concept of parallel transport to cases with sharp curve crossings. We demonstrate that this algorithm performs well under extreme situations where dozens of states cross each other either through trivial crossings (where there is zero effective diabatic coupling), or through non-trivial crossings (when there is a non-zero diabatic coupling), or through a combination of both. In all cases, we compute the time-derivative coupling matrix elements (or equivalently non-adiabatic derivative coupling matrix elements) that are as smooth as possible. Our results should be of interest to all who are interested in either non-adiabatic dynamics, or more generally, parallel transport in large systems.
UR - https://www.scopus.com/pages/publications/85077642896
UR - https://www.scopus.com/pages/publications/85077642896#tab=citedBy
U2 - 10.1021/acs.jctc.9b00952
DO - 10.1021/acs.jctc.9b00952
M3 - Article
C2 - 31869225
AN - SCOPUS:85077642896
SN - 1549-9618
VL - 16
SP - 835
EP - 846
JO - Journal of Chemical Theory and Computation
JF - Journal of Chemical Theory and Computation
IS - 2
ER -