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/0312021 · Physical Review E

Quantum statistical calculations and symplectic corrector algorithms

Siu A. Chin

Published Apr 30, 2004• 54 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreve.69.046118

Related papers

Positive Decompositions of Exponential Operators

Siu A. Chin

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.

arXiv:physics/0312005•Dec 1, 2003•0 citations

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 [EL, [L, EL]]. 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.

arXiv:nucl-th/0009068•International Journal of Modern Physics B•May 10, 2001•8 citations

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

Green’s function Monte Carlo method with exact imaginary-time propagation

Kevin E. Schmidt, Parhat Niyaz, Amanda L. Vaught +1 more

We present a general formulation of the Green's function Monte Carlo method in imaginary-time quantum Monte Carlo which employs exact propagators. This algorithm has no time-step errors and is obtained by minimal modifications of the time-independent Green's function Monte Carlo method. We describe how the method can be applied to the many-body Schrödinger equation, lattice Hamiltonians, and simple field theories. Our modification of the Green's function Monte Carlo algorithm is applied to the ground state of liquid 4He. We calculate the zero-temperature imaginary-time diffusion constant and relate that to the effective mass of a mass-four "impurity" atom in liquid 4He.

Physical Review E•Jan 1, 2005•43 citations

Fourth-order diffusion Monte Carlo algorithms for solving quantum many-body problems

Harald Forbert, Siu A. Chin

By decomposing the important sampled imaginary time Schr\"odinger evolution operator to fourth order with positive coefficients, we derived a number of distinct fourth-order diffusion Monte Carlo algorithms. These sophisticated algorithms require higher derivatives of the drift velocity and local energy and are more complicated to program. However, they allowed very large time steps to be used, converged faster with lesser correlations, and virtually eliminated the step size error. We demonstrated the effectiveness of these quartic algorithms by solving for the ground-state energy and radial density distribution of bulk liquid helium.

Physical review. B, Condensed matter•Mar 21, 2001•35 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
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 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 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 [EL, [L, EL]]. 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.
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.
We present a general formulation of the Green's function Monte Carlo method in imaginary-time quantum Monte Carlo which employs exact propagators. This algorithm has no time-step errors and is obtained by minimal modifications of the time-independent Green's function Monte Carlo method. We describe how the method can be applied to the many-body Schrödinger equation, lattice Hamiltonians, and simple field theories. Our modification of the Green's function Monte Carlo algorithm is applied to the ground state of liquid 4He. We calculate the zero-temperature imaginary-time diffusion constant and relate that to the effective mass of a mass-four "impurity" atom in liquid 4He.
By decomposing the important sampled imaginary time Schr\"odinger evolution operator to fourth order with positive coefficients, we derived a number of distinct fourth-order diffusion Monte Carlo algorithms. These sophisticated algorithms require higher derivatives of the drift velocity and local energy and are more complicated to program. However, they allowed very large time steps to be used, converged faster with lesser correlations, and virtually eliminated the step size error. We demonstrated the effectiveness of these quartic algorithms by solving for the ground-state energy and radial density distribution of bulk liquid helium.
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.