178+ open-access research outputs.
We present an efficient implementation of the low-cost linear-response coupled-cluster singles and doubles (LR-CCSD) method for computing static and frequency-dependent polarizabilities in systems wit…
Tensor hypercontraction provides an attractive four-center two-electron repulsion integral format that can lower the scaling of many electronic structure methods while only requiring O(N^2) memory. Ho…
Ultrafast multidimensional spectroscopies are powerful tools that can access charge and energy flow in complex materials, shifting chemical kinetics, and even many-body interactions in correlated matt…
We introduce a GPU-accelerated implementation of time-dependent density functional theory with the minimal auxiliary basis approach (TDDFT-risp) in GPU4PySCF, together with large system demonstrations…
We present a computationally efficient relativistic formulation of the equation-of-motion coupled-cluster method for the double electron attachment problem. In this work, the exact two-component Hamil…
We introduce a GPU-accelerated multigrid Gaussian-Plane-Wave density fitting (FFTDF) approach for efficient Fock builds and nuclear gradient evaluations within Kohn-Sham density functional theory, as …
In this work, we introduce new batching algorithms to effectively handle large contractions encountered in coupled-cluster singles and doubles (CCSD) implementations in Python on the Video Random Acce…
TENSO is a versatile and powerful open-source software package for numerically exact simulations of the dynamics of quantum systems immersed in structured thermal environments. It is based on a tree t…
A key challenge for molecular dynamics simulations is efficient exploration of free energy landscapes over relevant collective variables (CV). Common methods for enhancing sampling become prohibitivel…
Parameter optimization in computational chemistry and physics often involves objective functions that are expensive to evaluate, noisy, non-differentiable, or composed of heterogeneous contributions o…
Semi- and quasi-classical (SC) theories can handle arbitrary interatomic interactions and are thus well-suited to predict quantum dynamics in condensed phases that encode energy and charge transport, …
The Hessian matrix (second derivatives) encodes far richer local curvature of the potential energy surface than energies and forces alone. However, training machine-learning interatomic potentials (ML…
The generalized quantum master equation provides a powerful framework for non-Markovian dynamics of open quantum systems. However, the accurate and efficient evaluation of the memory kernel remains a …
Accurately simulating the non-Markovian dynamics of open quantum systems remains a significant challenge. While the recently proposed time-evolving matrix product operator (TEMPO) algorithm based on p…
We report a $k$-point extension of the second-order co-iterative augmented Hessian (CIAH) algorithm, termed $k$-CIAH, for Pipek-Mezey (PM) localization of Wannier functions (WFs). By exploiting an eff…
High-throughput quantum-chemical calculations underpin modern molecular modelling, materials discovery, and machine-learning workflows, yet even semi-empirical methods become restrictive when many mol…
The nuclear electric quadrupole moment (NQM) of $^{87}$Sr has recently been revisited using high-precision relativistic atomic calculations [B. Lu et al., Phys. Rev. A 100, 012504 (2019)], indicating …
Fewest-switches surface hopping (FSSH) is the most popular method for simulating photochemical processes of molecular systems. Recently, we have constructed long short-term memory (LSTM) networks as a…
The rapid development of pretrained Machine Learning Interatomic Potentials (MLIPs) that cover a wide range of molecular species has made it challenging to select the best model for a given applicatio…
Accurately modeling quantum dissipative dynamics remains challenging due to environmental complexity and non-Markovian memory effects. Although machine learning provides a promising alternative to con…
Free open-access publishing with Google Scholar indexing.
Submission Guide →