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

Physical Review A

Recursive generation of higher-order terms in the Magnus expansion

Serge Klarsfeld, José Ángel Oteo

Published Apr 1, 1989• 86 citations
Publisher

Abstract

Several methods for systematically calculating higher-order terms in the Magnus expansion of the time-displacement operator are discussed from a unified point of view. It is shown that a quadratic recursive scheme recently introduced in the average Hamiltonian formalism of NMR spectroscopy can be extended to other cases, including the original multiple commutator approach developed by Magnus [Commun. Pure Appl. Math. 7, 649 (1954)].

DOI
10.1103/physreva.39.3270

Related papers

Magnus expansion generator

Douglas P. Burum

A recursion formula for the Magnus expansion is presented which can be used to deduce higher-order terms and to investigate their properties. The application of this formula is illustrated with several examples which were motivated by NMR spectroscopy.

Physical review. B, Condensed matter•Oct 1, 1981•62 citations

Iterative approach to the exponential representation of the time–displacement operator

José Ángel Oteo, J Ros

An iterative method due to Voslamber is reconsidered. It provides successive approximations for the logarithm of the time–displacement operator in quantum mechanics. The procedure may be interpreted, a posteriori, as an infinite re-summation of terms in the so-called Magnus expansion. A recursive generator for higher terms is obtained. From two illustrative examples, a detailed comparative study is carried out between the results of the iterative method and those of the Magnus expansion.

Journal of Physics A Mathematical and General•Apr 25, 2005•1 citation

A note on Magnus formula

Domingo P. Prato, Pedro W. Lamberti

In this paper we reanalyze the Magnus formula for the time evolution operator in quantum mechanics from an algorithmic point of view. We give some rules to obtain the general term in the expansion as a compact time-ordered integral. These rules are easily applied to higher orders; in particular, we give explicitly the fifth order.

The Journal of Chemical Physics•Mar 15, 1997•27 citations

A sharper Magnus expansion bound woven in binary branches

Harriet Apel, Toby S. Cubitt, Emilio Onorati

The Magnus expansion provides an exponential representation of one-parameter operator families, expressed as a series expansion in their generators. This is particularly relevant in quantum mechanics for describing a unitary evolution determined by a time-dependent Hamiltonian generator of the dynamics. The solution is constructed as a series expansion in terms of increasingly complex nested commutators that rapidly become challenging to compute directly. This work establishes a universal upper bound scaling as $O\big((A(t)/ξ)^n n^{-3/2}\big)$ on the error incurred when the Magnus expansion is truncated at an arbitrary order. The factor $n^{-3/2}$ sharpens the exponential suppression governed by the integrated norm of the generator $A(t)$ and the convergence radius $ξ$, and we prove that this dependence on the order $n$ is optimal for the corresponding majorant. The main technical ingredient of the proof is the binary tree representation introduced by Iserles and Norsett from which we derive a recursion formula to delimit the magnitude of any term in the expansion. We complement our analytic bound with explicit computation of the first tree coefficients. With these findings we aim to contribute to the understanding of the accuracy and limitations of the Magnus expansion technique, and to provide a sharper bound for approximating quantum dynamics when information on the generator is not available.

arXiv:2509.18312•Sep 22, 2025•4 citations

Propagators for Quantum-Classical Models: Commutator-Free Magnus Methods

Adrián Gómez Pueyo, Sergio Blanes, Alberto Castro

We consider the numerical propagation of models that combine both quantum and classical degrees of freedom, usually, electrons and nuclei, respectively. We focus, in our computational examples, on the case in which the quantum electrons are modeled with time-dependent density-functional theory, although the methods discussed below can be used with any other level of theory. Often, for these so-called quantum-classical molecular dynamics models, one uses some propagation technique to deal with the quantum part and a different one for the classical equations. While the resulting procedure may, in principle, be consistent, it can however spoil some of the properties of the methods, such as the accuracy order with respect to the time step or the preservation of the geometrical structure of the equations. Few methods have been developed specifically for hybrid quantum-classical models. We propose using the same method for both the quantum and classical particles, in particular, one family of techniques that proves to be very efficient for the propagation of Schrödinger-like equations: the (quasi)-commutator free Magnus expansions. These have been developed, however, for linear systems, yet our problem is nonlinear: formally, the full quantum-classical system can be rewritten as a nonlinear Schrödinger equation, i.e., one in which the Hamiltonian depends on the system itself. The Magnus expansion algorithms for linear systems require the application of the Hamiltonian at intermediate points in a given propagating interval. For nonlinear systems, this poses a problem as this Hamiltonian is unknown due to its dependence on the state. We approximate it by employing a higher order extrapolation using previous steps as input. The resulting technique can then be regarded as a multistep technique or, alternatively, as a predictor corrector formula.

Journal of Chemical Theory and Computation•Jan 30, 2020•6 citations

An alternative to the magnus expansion in time-dependent perturbation theory

W. R. Salzman

An alternative to the Magnus expansion in time-dependent quantum mechanical perturbation theory is presented. An exponential form of the time-development operator, given as the exponential of a sum of products of integrals well known in time-dependent quantum mechanics, is derived from the standard perturbation expansion. The derivation is simple and the form of the terms in the exponential is so straightforward that the Nth order term can be written by inspection. The standard Magnus terms can be obtained by rearrangement of the terms of the new expansion probably easier than they can be obtained by iteration of the original equations. A proof by induction is presented to establish the form of the Nth term and it is shown how the new expansion terms relate to the Magnus terms. Some apparent differences between Magnus terms in the literature are resolved.

The Journal of Chemical Physics•Jan 15, 1985•53 citations
Several methods for systematically calculating higher-order terms in the Magnus expansion of the time-displacement operator are discussed from a unified point of view. It is shown that a quadratic recursive scheme recently introduced in the average Hamiltonian formalism of NMR spectroscopy can be extended to other cases, including the original multiple commutator approach developed by Magnus [Commun. Pure Appl. Math. 7, 649 (1954)].
The Magnus expansion provides an exponential representation of one-parameter operator families, expressed as a series expansion in their generators. This is particularly relevant in quantum mechanics for describing a unitary evolution determined by a time-dependent Hamiltonian generator of the dynamics. The solution is constructed as a series expansion in terms of increasingly complex nested commutators that rapidly become challenging to compute directly. This work establishes a universal upper bound scaling as O((A(t)/ξ)nn−3/2)O\big((A(t)/ξ)^n n^{-3/2}\big)O((A(t)/ξ)nn−3/2) on the error incurred when the Magnus expansion is truncated at an arbitrary order. The factor n−3/2n^{-3/2}n−3/2 sharpens the exponential suppression governed by the integrated norm of the generator A(t)A(t)A(t) and the convergence radius ξξξ, and we prove that this dependence on the order nnn is optimal for the corresponding majorant. The main technical ingredient of the proof is the binary tree representation introduced by Iserles and Norsett from which we derive a recursion formula to delimit the magnitude of any term in the expansion. We complement our analytic bound with explicit computation of the first tree coefficients. With these findings we aim to contribute to the understanding of the accuracy and limitations of the Magnus expansion technique, and to provide a sharper bound for approximating quantum dynamics when information on the generator is not available.
We consider the numerical propagation of models that combine both quantum and classical degrees of freedom, usually, electrons and nuclei, respectively. We focus, in our computational examples, on the case in which the quantum electrons are modeled with time-dependent density-functional theory, although the methods discussed below can be used with any other level of theory. Often, for these so-called quantum-classical molecular dynamics models, one uses some propagation technique to deal with the quantum part and a different one for the classical equations. While the resulting procedure may, in principle, be consistent, it can however spoil some of the properties of the methods, such as the accuracy order with respect to the time step or the preservation of the geometrical structure of the equations. Few methods have been developed specifically for hybrid quantum-classical models. We propose using the same method for both the quantum and classical particles, in particular, one family of techniques that proves to be very efficient for the propagation of Schrödinger-like equations: the (quasi)-commutator free Magnus expansions. These have been developed, however, for linear systems, yet our problem is nonlinear: formally, the full quantum-classical system can be rewritten as a nonlinear Schrödinger equation, i.e., one in which the Hamiltonian depends on the system itself. The Magnus expansion algorithms for linear systems require the application of the Hamiltonian at intermediate points in a given propagating interval. For nonlinear systems, this poses a problem as this Hamiltonian is unknown due to its dependence on the state. We approximate it by employing a higher order extrapolation using previous steps as input. The resulting technique can then be regarded as a multistep technique or, alternatively, as a predictor corrector formula.
An alternative to the Magnus expansion in time-dependent quantum mechanical perturbation theory is presented. An exponential form of the time-development operator, given as the exponential of a sum of products of integrals well known in time-dependent quantum mechanics, is derived from the standard perturbation expansion. The derivation is simple and the form of the terms in the exponential is so straightforward that the Nth order term can be written by inspection. The standard Magnus terms can be obtained by rearrangement of the terms of the new expansion probably easier than they can be obtained by iteration of the original equations. A proof by induction is presented to establish the form of the Nth term and it is shown how the new expansion terms relate to the Magnus terms. Some apparent differences between Magnus terms in the literature are resolved.