A general decomposition theory of ordered exponentials is presented by reducing the problem to the decomposition of ordinary exponential operators in terms of the super-operator 9 defined by F(t)exp( dt9)G(t) = F(t+ dt)G(t).It is proved that f t+dt T exp (s)ds = exp[dt((t) + 9)].Here T denotes the time ordering.
A general scheme of fractal decomposition of exponential operators is presented in any order m. Namely, exp[x(A+B)]=Sm(x)+O(xm+1) for any positive integer m, where Sm(x)=et1A et2B et3A et4B⋅⋅⋅etMA with finite M depending on m. A general recursive scheme of construction of {tj} is given explicitly. It is proven that some of {tj} should be negative for m≥3 and for any finite M (nonexistence theorem of positive decomposition). General systematic decomposition criterions based on a new type of time-ordering are also formulated. The decomposition exp[x(A+B)]=[Sm(x/n)]n +O(xm+1/nm) yields a new efficient approach to quantum Monte Carlo simulations.
We present a decomposition scheme based on Lie–Trotter–Suzuki product formulae to approximate an ordered operator exponential with a product of ordinary operator exponentials. We show, using a counterexample, that Lie–Trotter–Suzuki approximations may be of a lower order than expected when applied to problems that have singularities or discontinuous derivatives of appropriate order. To address this problem, we present a set of criteria that is sufficient for the validity of these approximations, prove convergence and provide upper bounds on the approximation error. This work may shed light on why related product formulae fail to be as accurate as expected when applied to Coulomb potentials.
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 2nth 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.
In the preceding paper ( Commun. Theor. Phys. 51 (2009) 321 ) we have recommended a convenient method for disentangling exponential operators. In this work we use this method for disentangling exponential operators composed of angular momentum operators. We mainly disentangle the form of exp[2hJ z + gJ + + kJ − ] as the ordering exp(...J + )exp(...J z )exp(...J − ), we employ the Schwinger Bose realization J − = b † a, J + = a † b, J z = (a † a − b † b)/2 to fulfil this task, without appealing to Lie algebra method. Note that this operator's disentangling is different from its decomposition in normal ordering.
There exists the well known approximate expression describing the large time behaviour of matrix elements of the evolution operator in quantum theory: =exp(at)+... This expression plays the crucial role in considerations of problems of quantum decoherence, radiation, decay, scattering theory, stochastic limit, derivation of master and kinetic equations etc. This expression was obtained in the Weisskopf-Wigner approximation and in the van Hove (stochastic) limit. We derive the exact general formula which includes the higher order corrections to the above approximate expression: =exp(At+B+C(t)). The constants A and B and the oscillating function C(t) are computed in perturbation theory. The method of perturbation of spectra and renormalized wave operators is used. The formula is valid for a general class of Hamiltonians used in statistical physics and quantum field theory.
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.