Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Brazilian Journal of Physics

Symplectic integration methods in molecular and spin dynamics simulations

Shan-Ho Tsai, M. Krech, David Paul Landau

Published Jun 1, 2004• 24 citations
Publisher

Abstract

We review recently developed decomposition algorithms for molecular dynamics and spin dynamics simulations of many-body systems. These methods are time reversible, symplectic, and the error in the total energy thus generated is bounded. In general, these techniques are accurate for much larger time steps than more standard integration methods. Illustrations of decomposition algorithms performance are shown for spin dynamics simulations of a Heisenberg ferromagnet.

DOI
10.1590/s0103-97332004000300009

Related papers

IMPROVED SPIN DYNAMICS SIMULATIONS OF MAGNETIC EXCITATIONS

David Paul Landau, Shan-Ho Tsai, M. Krech +1 more

Using Suzuki–Trotter decompositions of exponential operators we describe new algorithms for the numerical integration of the equations of motion for classical spin systems. These techniques conserve spin length exactly and, in special cases, also conserve the energy and maintain time reversibility. We investigate integration schemes of up to eighth order and show that these new algorithms can be used with much larger time steps than a well established predictor–corrector method. These methods may lead to a substantial speedup of spin dynamics simulations, however, the choice of which order method to use is not always straightforward.

arXiv:cond-mat/9912373•International Journal of Modern Physics C•Dec 1, 1999•9 citations

Suzuki-Trotter Decompositions and other Methods for Quantum Time Evolution

Johann Ostmeyer

(Suzuki-)Trotter decompositions, splitting methods, (Lie) product formulae... The most common numerical methods for the time evolution of quantum systems come with many names. And they are used practically everywhere with applications ranging from the solution of classical equations of motion and various Monte Carlo simulations to the real and imaginary time evolution on classical as well as quantum computers. Here we review the state of the art of said methods, focussing especially on the progress made over the last few years. We highlight recently discovered efficient time evolution algorithms and explain how best to use them in practice. A central part of this work is the estimation of error bounds that has improved greatly within the past decade. The relevance of time evolution methods for quantum computing is discussed with a focus on noisy hardware. Finally, a comprehensive overview of generalisations, related methods and alternatives to Trotterization is provided. This includes time-dependent Hamiltonian dynamics, processed methods, multi-product formulae, symplectic integrators, TDVP for tensor networks, quantum signal processing, Crouch-Grossman methods and more. The overall perspective in this work is that of a theoretical physicist. All mathematical proofs as well as some technical details are omitted for easier readability. Instead, this review serves as a hands-on guide and, of course, as a starting point for references that provide further details.

quant-pharXiv:2609.19184•Sep 16, 2026•2 citations

Molecular dynamics simulations of spin and pure liquids with preservation of all the conservation laws

I. P. Omelyan, I. M. Mryglod, R. Folk

A methodology is developed to integrate numerically the equations of motion for classical many-body systems in molecular dynamics simulations. Its distinguishable feature is the possibility to preserve, independently on the size of the time step, all the conservation laws inherent in the description without breaking the time reversibility. As a result, an implicit second-order algorithm is derived and applied to pure liquids, as well as spin liquids, for which the dynamics is characterized by the conservation of total energy, linear and angular momenta, as well as magnetization and individual spin lengths. It is demonstrated on the basis of Lennard-Jones and Heisenberg fluid models that when such quantities as energy and magnetization must be conserved perfectly, the algorithm turns out to be more efficient than popular decomposition integrators and standard predictor-corrector schemes.

arXiv:cond-mat/0012182•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Jun 13, 2001•16 citations

A Quantum Algorithm for Molecular Dynamics Simulation

Yale Fan

Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. One of the central unresolved problems in developing quantum simulation algorithms has been constructing the necessary time evolution operators in enough detail for implementation in a quantum computer. This work presents a complete and very general solution to this problem: namely, a quantum computational algorithm for simulating an arbitrary Coulombic many-body system acting under the three-dimensional Schrödinger equation. We use the simplest discretized model and discuss detailed constructions of the operators involved. The algorithm is also implemented in MAT-LAB and tested against both analytical solutions and classical methods. Our algorithm can determine an arbitrary system’s dynamics rather than merely associated constants, as investigated in previous literature. It can hence be adapted for electronic structure calculations, chemical reaction simulations, etc. 1

•Jan 27, 2009•2 citations

The formulation of quantum statistical mechanics based on the Feynman path centroid density. IV. Algorithms for centroid molecular dynamics

Jianshu Cao, Gregory A. Voth

Numerical algorithms are developed for the centroid molecular dynamics (centroid MD) method to calculate dynamical time correlation functions for general many-body quantum systems. Approaches based on the normal mode path integral molecular dynamics and staging path integral Monte Carlo methods are described to carry out a direct calculation of the force on the centroid variables in the centroid MD algorithm. A more efficient, but approximate, scheme to compute the centroid force is devised which is based on the locally optimized harmonic approximation for the centroid potential. The centroid MD equations in the latter method can be solved with the help of an iterative procedure or through extended Lagrangian dynamics. A third algorithm introduces an effective centroid pseudopotential to approximate the full many-body centroid mean force potential by effective pairwise centroid interactions. Numerical simulations for both prototype models and more realistic many-body systems are performed to explore the feasibility and limitations of each algorithm.

The Journal of Chemical Physics•Oct 1, 1994•381 citations

Computational dynamics of fermion and spin systems

Ian G. White

The study of quantum dynamics is an increasingly important aspect of atomic, molecular and optical physics, as well as condensed-matter physics and other disciplines. It is essential in order to understand non-equilibrium phenomena which do not fit within the framework of equilibrium thermodynamics, such as many-body localization, dynamical quantum phase transitions, and non-equilibrium steady states in driven-dissipative systems. However, the exact calculation of dynamical observables is extremely difficult in general for several reasons, which makes it challenging for theoretical predictions and analyses to keep pace with rapidly advancing experiments. In this thesis I use and develop several computational methods to investigate the dynamics of quantum many-body systems, with the two goals of better understanding the evolution of local observables and correlation functions in spin and Fermion systems as well as creating and testing more effective numerical methods for solving quantum dynamics problems. I explore quantum dynamics by using Hamiltonian parameter quenches in several commonly-used models in AMO physics and elsewhere: the Fermi-Hubbard model, the XXZ model, and the transverse-Ising model. The first represents a system of short-range interacting Fermions, while the latter two represent spin systems with different spin-spin couplings and magnetic field terms. All of these models can be realized in current experiments. First, I derive an exact solution for an extreme interaction quench in the Fermi-Hubbard model, from a strongly-interacting initial state to a noninteracting final Hamiltonian. From this result I show that there are nontrivial transient connected correlations, despite the fact that the system has very high temperature and a noninteracting Hamiltonian. Those features would suppress such correlations in equilibrium, but the dynamical correlations are still significant. Then, I develop and examine two numerical methods for solving dynamics of the spin expectation values and correlation functions in the transverse-Ising and XXZ models. Both methods rely on approximating a thermodynamically large system with a much smaller and more computationally tractable cluster of lattice sites, or a series of clusters. The first method is a dynamical numerical linked cluster expansion (NLCE). NLCEs have already been used successfully on systems in thermodynamic equilibrium, and I extended the technique to directly compute the dynamics of an observable after a quantum quench. I review the general NLCE method, describe my dynamical variant of it, and compute the quench dynamics of spin and correlation observables in the transverse-Ising and XXZ models. The second method, which I term the adaptive-boundary cluster method, relies on recently refined bounds on information propagation in quantum systems to choose a cluster of lattice sites that minimizes the finite size error bound of a dynamical computation. I briefly review these bounds, and describe a new algorithm which uses them to construct a cluster whose boundary is chosen according to a related error estimate. Such an adaptive-boundary cluster has the property that there exists a computable upper bound on the finite size error of observables measured at the cluster center, and this error bound is nearly minimal when compared to that of other clusters of the same size. I then compute the quench dynamics of spin and correlation observables in the transverse-Ising model using the adaptive boundary clusters. I apply this method to both uniform and strongly disordered systems. To evaluate the effectiveness of both dynamical NLCE and adaptive-boundary clusters, I compare the results obtained using them to results from a standard and general purpose numerical method: exact solvers applied a rectangular cluster with periodic boundary conditions. Both of the new methods usually converge faster and are more accurate than the standard method for comparable cluster sizes. This thesis illustrates that choosing numerical methods which take advantage of the geometric and entanglement structure of the initial state and Hamiltonian can substantially enhance our ability to study quantum dynamics, by reducing the computational cost of numerically exact solutions. I conclude with a discussion of various avenues for future research to build on this work.

•Apr 23, 2020•0 citations
We review recently developed decomposition algorithms for molecular dynamics and spin dynamics simulations of many-body systems. These methods are time reversible, symplectic, and the error in the total energy thus generated is bounded. In general, these techniques are accurate for much larger time steps than more standard integration methods. Illustrations of decomposition algorithms performance are shown for spin dynamics simulations of a Heisenberg ferromagnet.
Using Suzuki–Trotter decompositions of exponential operators we describe new algorithms for the numerical integration of the equations of motion for classical spin systems. These techniques conserve spin length exactly and, in special cases, also conserve the energy and maintain time reversibility. We investigate integration schemes of up to eighth order and show that these new algorithms can be used with much larger time steps than a well established predictor–corrector method. These methods may lead to a substantial speedup of spin dynamics simulations, however, the choice of which order method to use is not always straightforward.
(Suzuki-)Trotter decompositions, splitting methods, (Lie) product formulae... The most common numerical methods for the time evolution of quantum systems come with many names. And they are used practically everywhere with applications ranging from the solution of classical equations of motion and various Monte Carlo simulations to the real and imaginary time evolution on classical as well as quantum computers. Here we review the state of the art of said methods, focussing especially on the progress made over the last few years. We highlight recently discovered efficient time evolution algorithms and explain how best to use them in practice. A central part of this work is the estimation of error bounds that has improved greatly within the past decade. The relevance of time evolution methods for quantum computing is discussed with a focus on noisy hardware. Finally, a comprehensive overview of generalisations, related methods and alternatives to Trotterization is provided. This includes time-dependent Hamiltonian dynamics, processed methods, multi-product formulae, symplectic integrators, TDVP for tensor networks, quantum signal processing, Crouch-Grossman methods and more. The overall perspective in this work is that of a theoretical physicist. All mathematical proofs as well as some technical details are omitted for easier readability. Instead, this review serves as a hands-on guide and, of course, as a starting point for references that provide further details.
A methodology is developed to integrate numerically the equations of motion for classical many-body systems in molecular dynamics simulations. Its distinguishable feature is the possibility to preserve, independently on the size of the time step, all the conservation laws inherent in the description without breaking the time reversibility. As a result, an implicit second-order algorithm is derived and applied to pure liquids, as well as spin liquids, for which the dynamics is characterized by the conservation of total energy, linear and angular momenta, as well as magnetization and individual spin lengths. It is demonstrated on the basis of Lennard-Jones and Heisenberg fluid models that when such quantities as energy and magnetization must be conserved perfectly, the algorithm turns out to be more efficient than popular decomposition integrators and standard predictor-corrector schemes.
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. One of the central unresolved problems in developing quantum simulation algorithms has been constructing the necessary time evolution operators in enough detail for implementation in a quantum computer. This work presents a complete and very general solution to this problem: namely, a quantum computational algorithm for simulating an arbitrary Coulombic many-body system acting under the three-dimensional Schrödinger equation. We use the simplest discretized model and discuss detailed constructions of the operators involved. The algorithm is also implemented in MAT-LAB and tested against both analytical solutions and classical methods. Our algorithm can determine an arbitrary system’s dynamics rather than merely associated constants, as investigated in previous literature. It can hence be adapted for electronic structure calculations, chemical reaction simulations, etc. 1
Numerical algorithms are developed for the centroid molecular dynamics (centroid MD) method to calculate dynamical time correlation functions for general many-body quantum systems. Approaches based on the normal mode path integral molecular dynamics and staging path integral Monte Carlo methods are described to carry out a direct calculation of the force on the centroid variables in the centroid MD algorithm. A more efficient, but approximate, scheme to compute the centroid force is devised which is based on the locally optimized harmonic approximation for the centroid potential. The centroid MD equations in the latter method can be solved with the help of an iterative procedure or through extended Lagrangian dynamics. A third algorithm introduces an effective centroid pseudopotential to approximate the full many-body centroid mean force potential by effective pairwise centroid interactions. Numerical simulations for both prototype models and more realistic many-body systems are performed to explore the feasibility and limitations of each algorithm.
The study of quantum dynamics is an increasingly important aspect of atomic, molecular and optical physics, as well as condensed-matter physics and other disciplines. It is essential in order to understand non-equilibrium phenomena which do not fit within the framework of equilibrium thermodynamics, such as many-body localization, dynamical quantum phase transitions, and non-equilibrium steady states in driven-dissipative systems. However, the exact calculation of dynamical observables is extremely difficult in general for several reasons, which makes it challenging for theoretical predictions and analyses to keep pace with rapidly advancing experiments. In this thesis I use and develop several computational methods to investigate the dynamics of quantum many-body systems, with the two goals of better understanding the evolution of local observables and correlation functions in spin and Fermion systems as well as creating and testing more effective numerical methods for solving quantum dynamics problems. I explore quantum dynamics by using Hamiltonian parameter quenches in several commonly-used models in AMO physics and elsewhere: the Fermi-Hubbard model, the XXZ model, and the transverse-Ising model. The first represents a system of short-range interacting Fermions, while the latter two represent spin systems with different spin-spin couplings and magnetic field terms. All of these models can be realized in current experiments. First, I derive an exact solution for an extreme interaction quench in the Fermi-Hubbard model, from a strongly-interacting initial state to a noninteracting final Hamiltonian. From this result I show that there are nontrivial transient connected correlations, despite the fact that the system has very high temperature and a noninteracting Hamiltonian. Those features would suppress such correlations in equilibrium, but the dynamical correlations are still significant. Then, I develop and examine two numerical methods for solving dynamics of the spin expectation values and correlation functions in the transverse-Ising and XXZ models. Both methods rely on approximating a thermodynamically large system with a much smaller and more computationally tractable cluster of lattice sites, or a series of clusters. The first method is a dynamical numerical linked cluster expansion (NLCE). NLCEs have already been used successfully on systems in thermodynamic equilibrium, and I extended the technique to directly compute the dynamics of an observable after a quantum quench. I review the general NLCE method, describe my dynamical variant of it, and compute the quench dynamics of spin and correlation observables in the transverse-Ising and XXZ models. The second method, which I term the adaptive-boundary cluster method, relies on recently refined bounds on information propagation in quantum systems to choose a cluster of lattice sites that minimizes the finite size error bound of a dynamical computation. I briefly review these bounds, and describe a new algorithm which uses them to construct a cluster whose boundary is chosen according to a related error estimate. Such an adaptive-boundary cluster has the property that there exists a computable upper bound on the finite size error of observables measured at the cluster center, and this error bound is nearly minimal when compared to that of other clusters of the same size. I then compute the quench dynamics of spin and correlation observables in the transverse-Ising model using the adaptive boundary clusters. I apply this method to both uniform and strongly disordered systems. To evaluate the effectiveness of both dynamical NLCE and adaptive-boundary clusters, I compare the results obtained using them to results from a standard and general purpose numerical method: exact solvers applied a rectangular cluster with periodic boundary conditions. Both of the new methods usually converge faster and are more accurate than the standard method for comparable cluster sizes. This thesis illustrates that choosing numerical methods which take advantage of the geometric and entanglement structure of the initial state and Hamiltonian can substantially enhance our ability to study quantum dynamics, by reducing the computational cost of numerically exact solutions. I conclude with a discussion of various avenues for future research to build on this work.