Dataset Information

Which Algorithm Best Propagates the Meyer-Miller-Stock-Thoss Mapping Hamiltonian for Non-Adiabatic Dynamics?

ABSTRACT: A common strategy to simulate mixed quantum-classical dynamics is by propagating classical trajectories with mapping variables, often using the Meyer-Miller-Stock-Thoss (MMST) Hamiltonian or the related spin-mapping approach. When mapping the quantum subsystem, the coupled dynamics reduce to a set of equations of motion to integrate. Several numerical algorithms have been proposed, but a thorough performance comparison appears to be lacking. Here, we compare three time-propagation algorithms for the MMST Hamiltonian: the Momentum Integral (MInt) (J. Chem. Phys., 2018, 148, 102326), the Split-Liouvillian (SL) (Chem. Phys., 2017, 482, 124-134), and the algorithm in J. Chem. Phys., 2012, 136, 084101 that we refer to as the Degenerate Eigenvalue (DE) algorithm due to the approximation required during derivation. We analyze the accuracy of individual trajectories, correlation functions, energy conservation, symplecticity, Liouville's theorem, and the computational cost. We find that the MInt algorithm is the only rigorously symplectic algorithm. However, comparable accuracy at a lower computational cost can be obtained with the SL algorithm. The approximation implicitly made within the DE algorithm conserves energy poorly, even for small timesteps, and thus leads to slightly different results. These results should guide future mapping-variable simulations.

SUBMITTER: Cook LE

PROVIDER: S-EPMC10536990 | biostudies-literature | 2023 Sep

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Which Algorithm Best Propagates the Meyer-Miller-Stock-Thoss Mapping Hamiltonian for Non-Adiabatic Dynamics?

Cook Lauren E LE Runeson Johan E JE Richardson Jeremy O JO Hele Timothy J H TJH

Journal of chemical theory and computation 20230913 18

A common strategy to simulate mixed quantum-classical dynamics is by propagating classical trajectories with mapping variables, often using the Meyer-Miller-Stock-Thoss (MMST) Hamiltonian or the related spin-mapping approach. When mapping the quantum subsystem, the coupled dynamics reduce to a set of equations of motion to integrate. Several numerical algorithms have been proposed, but a thorough performance comparison appears to be lacking. Here, we compare three time-propagation algorithms for ...[more]

PMID: 37704193

Similar Datasets

Project description:The time scales of long-time atomistic molecular dynamics simulations are typically reported in microseconds, while the time scales for experiments studying the kinetics of amyloid fibril formation are typically reported in minutes or hours. This time scale deficit of roughly 9 orders of magnitude presents a major challenge in the design of computer simulation methods for studying protein aggregation events. Coarse-grained molecular simulations offer a computationally tractable path forward for exploring the molecular mechanism driving the formation of these structures, which are implicated in diseases such as Alzheimer's, Parkinson's, and type-II diabetes. Network Hamiltonian models of aggregation are centered around a Hamiltonian function that returns the total energy of a system of aggregating proteins, given the graph structure of the system as an input. In the graph, or network, representation of the system, each protein molecule is represented as a node, and noncovalent bonds between proteins are represented as edges. The parameter, i.e., a set of coefficients that determine the degree to which each topological degree of freedom is favored or disfavored, must be determined for each network Hamiltonian model, and is a well-known technical challenge. The methodology is first demonstrated by beginning with an initial set of randomly parametrized models of low fibril fraction (<5% fibrillar), and evolving to subsequent generations of models, ultimately leading to high fibril fraction models (>70% fibrillar). The methodology is also demonstrated by applying it to optimizing previously published network Hamiltonian models for the 5 key amyloid fibril topologies that have been reported in the Protein Data Bank (PDB). The models generated by the AI produced fibril fractions that surpass previously published fibril fractions in 3 of 5 cases, including the most naturally abundant amyloid fibril topology, the 1,2 2-ribbon, which features a steric zipper. The authors also aim to encourage more widespread use of the network Hamiltonian methodology for fitting a wide variety of self-assembling systems by releasing a free open-source implementation of the genetic algorithm introduced here.

Dataset Information

Which Algorithm Best Propagates the Meyer-Miller-Stock-Thoss Mapping Hamiltonian for Non-Adiabatic Dynamics?

Publications

Which Algorithm Best Propagates the Meyer-Miller-Stock-Thoss Mapping Hamiltonian for Non-Adiabatic Dynamics?

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets