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:physics/0312005

Positive Decompositions of Exponential Operators

Siu A. Chin

Published Dec 1, 2003• 0 citations
arXivHTMLPDF

Abstract

The solution of many physical evolution equations can be expressed as an exponential of two or more operators. Approximate solutions can be systematically derived by decomposing the exponential in a product form. For time-reversible equations, such as the Hamilton or the Schr\\"odinger equation, it is immaterial whether the decomposition coefficients are positive or negative. For time-irreversible systems, such as the Fokker-Planck equation or the quantum statistical propagator, only positive-coefficient decompositions which respect the time-irreversibility of the diffusion kernel can yield practical algorithms. These positive time step, or forward decompositions, are a highly restrictive class of factorization algorithms. This work proves a fundamental theorem: in order for a $2n$th order forward algorithm to become $(2n+2)$th order, one must include a new, higher order commutator in the decomposition process. Since these higher order commuatators are highly complex, it seems difficult to produce practical forward algorithms beyond fourth order. This proof generalize the Sheng-Suzuki theorem for the case of $n=1$. In particular, this work shows that it is not possible to have a sixth order forward algorithm by including just the $[V,[T,V]]$ commutator.

Related papers

High order non-unitary split-step decomposition of unitary operators

Tomaž Prosen, Iztok Pižorn

We propose a high order numerical decomposition of exponentials of Hermitian operators in terms of a product of exponentials of simple terms, following an idea which has been pioneered by M Suzuki, implementing it for complex coefficients. We outline a convenient fourth-order formula which can be written compactly for an arbitrary number of non-commuting terms in the Hamiltonian and which is superior to the optimal formula with real coefficients, both in complexity and accuracy. We show asymptotic stability of our method for a sufficiently small time step and demonstrate its efficiency and accuracy in different numerical models.

arXiv:quant-ph/0602074•Journal of Physics A Mathematical and General•May 3, 2006•13 citations

Quantum statistical calculations and symplectic corrector algorithms

Siu A. Chin

The quantum partition function at finite temperature requires computing the trace of the imaginary time propagator. For numerical and Monte Carlo calculations, the propagator is usually split into its kinetic and potential parts. A higher-order splitting will result in a higher-order convergent algorithm. At imaginary time, the kinetic energy propagator is usually the diffusion Green's function. Since diffusion cannot be simulated backward in time, the splitting must maintain the positivity of all intermediate time steps. However, since the trace is invariant under similarity transformations of the propagator, one can use this freedom to "correct" the split propagator to higher order. This use of similarity transforms classically gives rise to symplectic corrector algorithms. The split propagator is the symplectic kernel and the similarity transformation is the corrector. This work proves a generalization of the Sheng-Suzuki theorem: no positive time step propagators with only kinetic and potential operators can be corrected beyond second order. Second-order forward propagators can have fourth-order traces only with the inclusion of an additional commutator. We give detailed derivations of four forward correctable second-order propagators and their minimal correctors.

arXiv:cond-mat/0312021•Physical Review E•Apr 30, 2004•54 citations

EXPONENTIAL PROPAGATORS (INTEGRATORS) FOR THE TIME-DEPENDENT SCHRÖDINGER EQUATION

André D. Bandrauk, Huizhong Lu

The time-dependent Schrödinger Equation (TDSE) is a parabolic partial differential equation (PDE) comparable to a diffusion equation but with imaginary time. Due to its first order time derivative, exponential integrators or propagators are natural methods to describe evolution in time of the TDSE, both for time-independent and time-dependent potentials. Two splitting methods based on Fer and/or Magnus expansions allow for developing unitary factorizations of exponentials with different accuracies in the time step △t. The unitary factorization of exponentials to high order accuracy depends on commutators of kinetic energy operators with potentials. Fourth-order accuracy propagators can involve negative or complex time steps, or real time steps only but with gradients of potentials, i.e. forces. Extending the propagators of TDSE's to imaginary time allows to also apply these methods to classical many-body dynamics, and quantum statistical mechanics of molecular systems.

Journal of Theoretical and Computational Chemistry•Apr 23, 2013•72 citations

Sixth-order factorization of the evolution operator for time-dependent potentials

G. Goldstein, D. Baye

The evolution operator of a quantum system in a time-dependent potential is factorized in unitary exponential operators at order 6. This expression is derived with the time-ordering method. It is compared with lower-order factorizations on several simple one-dimensional examples. Better accuracies are reached at sixth order for a given time step than at lower orders. Due to a significant increase of computation duration per time step, the sixth-order approximation is mainly useful when high accuracies are required.

Physical Review E•Nov 15, 2004•29 citations

A method for exponential operator decomposition

Seçkin Şefi, Peter van Loock

Exponential operator decompositions are an important tool in many fields of physics, for example, in quantum control, quantum computation, or condensed matter physics. In this work, we present a method for obtaining such decompositions, which is efficient in terms of the required number of operators. Compared to existing schemes, our more direct approach is general, in the sense that it can be applied to various kinds of operators including nested commutation operators, and it is systematic.

arXiv:1104.1148•Apr 6, 2011•1 citation

A FOURTH ORDER DIFFUSION MONTE CARLO ALGORITHM FOR SOLVING QUANTUM MANY-BODY PROBLEMS

Harald Forbert, Siu A. Chin

We derive a fourth-order diffusion Monte Carlo algorithm for solving quantum many-body problems. The method uses a factorization of the imaginary time propagator in terms of the usual local energy E and Langevin operators L as well as an additional pseudo-potential consisting of the double commutator [E L , [L,E L ]]. A new factorization of the propagator of the Fokker-Planck equation enables us to implement the Langevin algorithm to the necessary fourth order. We achieve this by the addition of correction terms to the drift steps and the use of a position-dependent Gaussian random walk. We show that in the case of bulk liquid helium the systematic step size errors are indeed fourth order over a wide range of step sizes.

Recent Progress in Many-Body Theories•Sep 1, 2000•0 citations
The solution of many physical evolution equations can be expressed as an exponential of two or more operators. Approximate solutions can be systematically derived by decomposing the exponential in a product form. For time-reversible equations, such as the Hamilton or the Schr\"odinger equation, it is immaterial whether the decomposition coefficients are positive or negative. For time-irreversible systems, such as the Fokker-Planck equation or the quantum statistical propagator, only positive-coefficient decompositions which respect the time-irreversibility of the diffusion kernel can yield practical algorithms. These positive time step, or forward decompositions, are a highly restrictive class of factorization algorithms. This work proves a fundamental theorem: in order for a 2n2n2nth order forward algorithm to become (2n+2)(2n+2)(2n+2)th order, one must include a new, higher order commutator in the decomposition process. Since these higher order commuatators are highly complex, it seems difficult to produce practical forward algorithms beyond fourth order. This proof generalize the Sheng-Suzuki theorem for the case of n=1n=1n=1. In particular, this work shows that it is not possible to have a sixth order forward algorithm by including just the [V,[T,V]][V,[T,V]][V,[T,V]] commutator.
We propose a high order numerical decomposition of exponentials of Hermitian operators in terms of a product of exponentials of simple terms, following an idea which has been pioneered by M Suzuki, implementing it for complex coefficients. We outline a convenient fourth-order formula which can be written compactly for an arbitrary number of non-commuting terms in the Hamiltonian and which is superior to the optimal formula with real coefficients, both in complexity and accuracy. We show asymptotic stability of our method for a sufficiently small time step and demonstrate its efficiency and accuracy in different numerical models.
The quantum partition function at finite temperature requires computing the trace of the imaginary time propagator. For numerical and Monte Carlo calculations, the propagator is usually split into its kinetic and potential parts. A higher-order splitting will result in a higher-order convergent algorithm. At imaginary time, the kinetic energy propagator is usually the diffusion Green's function. Since diffusion cannot be simulated backward in time, the splitting must maintain the positivity of all intermediate time steps. However, since the trace is invariant under similarity transformations of the propagator, one can use this freedom to "correct" the split propagator to higher order. This use of similarity transforms classically gives rise to symplectic corrector algorithms. The split propagator is the symplectic kernel and the similarity transformation is the corrector. This work proves a generalization of the Sheng-Suzuki theorem: no positive time step propagators with only kinetic and potential operators can be corrected beyond second order. Second-order forward propagators can have fourth-order traces only with the inclusion of an additional commutator. We give detailed derivations of four forward correctable second-order propagators and their minimal correctors.
The time-dependent Schrödinger Equation (TDSE) is a parabolic partial differential equation (PDE) comparable to a diffusion equation but with imaginary time. Due to its first order time derivative, exponential integrators or propagators are natural methods to describe evolution in time of the TDSE, both for time-independent and time-dependent potentials. Two splitting methods based on Fer and/or Magnus expansions allow for developing unitary factorizations of exponentials with different accuracies in the time step △t. The unitary factorization of exponentials to high order accuracy depends on commutators of kinetic energy operators with potentials. Fourth-order accuracy propagators can involve negative or complex time steps, or real time steps only but with gradients of potentials, i.e. forces. Extending the propagators of TDSE's to imaginary time allows to also apply these methods to classical many-body dynamics, and quantum statistical mechanics of molecular systems.
The evolution operator of a quantum system in a time-dependent potential is factorized in unitary exponential operators at order 6. This expression is derived with the time-ordering method. It is compared with lower-order factorizations on several simple one-dimensional examples. Better accuracies are reached at sixth order for a given time step than at lower orders. Due to a significant increase of computation duration per time step, the sixth-order approximation is mainly useful when high accuracies are required.
We derive a fourth-order diffusion Monte Carlo algorithm for solving quantum many-body problems. The method uses a factorization of the imaginary time propagator in terms of the usual local energy E and Langevin operators L as well as an additional pseudo-potential consisting of the double commutator [E L , [L,E L ]]. A new factorization of the propagator of the Fokker-Planck equation enables us to implement the Langevin algorithm to the necessary fourth order. We achieve this by the addition of correction terms to the drift steps and the use of a position-dependent Gaussian random walk. We show that in the case of bulk liquid helium the systematic step size errors are indeed fourth order over a wide range of step sizes.