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

arXiv:cond-mat/9912373 · International Journal of Modern Physics C

IMPROVED SPIN DYNAMICS SIMULATIONS OF MAGNETIC EXCITATIONS

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

Published Dec 1, 1999• 9 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1142/s0129183199001327

Related papers

Conservation-laws-preserving algorithms for spin dynamics simulations

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

We propose new algorithms for numerical integration of the equations of motion for classical spin systems with fixed spatial site positions. The algorithms are derived on the basis of a mid-point scheme in conjunction with the multiple time staging propagation. Contrary to existing predictor-corrector and decomposition approaches, the algorithms introduced preserve all the integrals of motion inherent in the basic equations. As is demonstrated for a lattice ferromagnet model, the present approach appears to be more efficient even over the recently developed decomposition method.

arXiv:cond-mat/0012108•Europhysics Letters (EPL)•Dec 15, 2000•5 citations

Efficient Trotter-Suzuki Schemes for Long-time Quantum Dynamics

Marko Maležič, Johann Ostmeyer

Accurately simulating long-time dynamics of many-body systems is a challenge in both classical and quantum computing due to the accumulation of Trotter errors. While low-order Trotter-Suzuki decompositions are straightforward to implement, their rapidly growing error limits access to long-time observables. We present a framework for constructing efficient high-order Trotter-Suzuki schemes by identifying their structure and directly optimizing their parameters over a high-dimensional space. This method enables the discovery of new schemes with significantly improved efficiency compared to traditional constructions, such as those by Suzuki and Yoshida. Based on the theoretical efficiency and practical performance, we recommend two novel highly efficient schemes at $4^{\textrm{th}}$ and $6^{\textrm{th}}$ order. We also demonstrate the effectiveness of these decompositions on the Heisenberg model and the quantum harmonic oscillator, and find that for a fixed final time they perform better across the computational cost. Even when using large time steps, they surpass established low-order schemes like the Leapfrog. Finally, we investigate the in-practice performance of different Trotter schemes and find the decompositions with more uniform coefficients tend to feature improved error accumulation over long times. We have included this observation into our choice of recommended schemes.

quant-pharXiv:2601.18756•Journal of Physics A Mathematical and Theoretical•Jan 27, 2026•6 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

Symplectic integration methods in molecular and spin dynamics simulations

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

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.

Brazilian Journal of Physics•Jun 1, 2004•24 citations

Reducing the Gate Count with Efficient Trotter-Suzuki Schemes

Marko Maležič, Johann Ostmeyer

Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on quantum hardware or classically, for instance with the use of tensor networks. While low-order Trotterizations remain the standard choice due to their simplicity, higher-order schemes offer the potential for improved efficiency. In this work we outline a short guide to Trotter-Suzuki schemes and their implementations in general. To help with this, we highlight new efficient schemes found by our optimization framework, and demonstrate their performance on the Heisenberg model.

hep-latCross-listedarXiv:2602.21145•International Symposium on Lattice Field Theory (LATTICE)•Feb 25, 2026•3 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
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.
We propose new algorithms for numerical integration of the equations of motion for classical spin systems with fixed spatial site positions. The algorithms are derived on the basis of a mid-point scheme in conjunction with the multiple time staging propagation. Contrary to existing predictor-corrector and decomposition approaches, the algorithms introduced preserve all the integrals of motion inherent in the basic equations. As is demonstrated for a lattice ferromagnet model, the present approach appears to be more efficient even over the recently developed decomposition method.
Accurately simulating long-time dynamics of many-body systems is a challenge in both classical and quantum computing due to the accumulation of Trotter errors. While low-order Trotter-Suzuki decompositions are straightforward to implement, their rapidly growing error limits access to long-time observables. We present a framework for constructing efficient high-order Trotter-Suzuki schemes by identifying their structure and directly optimizing their parameters over a high-dimensional space. This method enables the discovery of new schemes with significantly improved efficiency compared to traditional constructions, such as those by Suzuki and Yoshida. Based on the theoretical efficiency and practical performance, we recommend two novel highly efficient schemes at 4th4^{\textrm{th}}4th and 6th6^{\textrm{th}}6th order. We also demonstrate the effectiveness of these decompositions on the Heisenberg model and the quantum harmonic oscillator, and find that for a fixed final time they perform better across the computational cost. Even when using large time steps, they surpass established low-order schemes like the Leapfrog. Finally, we investigate the in-practice performance of different Trotter schemes and find the decompositions with more uniform coefficients tend to feature improved error accumulation over long times. We have included this observation into our choice of recommended schemes.
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.
Hamiltonian formulations of lattice field theories provide access to real-time dynamics, but their simulation is difficult to implement efficiently. Trotter-Suzuki decompositions are at the center of time evolution computation, either on quantum hardware or classically, for instance with the use of tensor networks. While low-order Trotterizations remain the standard choice due to their simplicity, higher-order schemes offer the potential for improved efficiency. In this work we outline a short guide to Trotter-Suzuki schemes and their implementations in general. To help with this, we highlight new efficient schemes found by our optimization framework, and demonstrate their performance on the Heisenberg model.
(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.