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

Acta Physico-Chimica Sinica

Comparison on the Symplectic Quantum Propagation Methods

Xinsheng Zhao, Zhu Wu-Sheng

Published Jan 1, 1996• 1 citation
Publisher
DOI
10.3866/pku.whxb19961004

Related papers

Symplectic quantum mechanics

M. D. de Oliveira, M.C.B. Fernandes, F. C. Khanna +2 more

Annals of Physics•May 13, 2004•41 citations

On the Symplectic Propagation of the Spin-MInt Algorithm for Non-Adiabatic Quantum Dynamics

James R. Rampton, Lauren E. Cook, Timothy J. H. Hele

Mapping methods are often used for the numerical simulation of nonadiabatic systems by propagating classical mapping variable trajectories. A recently popularised mapping method is spin-mapping, whose mapping variables arise from quantum mechanical operators with symmetries described by a Lie-Poisson algebra. Simulating the classical-like dynamics of spin-mapping systems accurately is generally challenging, with many methods unable to preserve the underlying geometric structure of the symplectic form. The Spin-MInt algorithm is a recently proposed algorithm propagating spin-mapping variables, with a direct proof of symplecticity existing only for 2 electronic states. Here, we directly prove the symplecticity of the Spin-MInt algorithm for a general $K$ electronic states. A review of the symplectic nature of coadjoint orbits of the $\mathfrak{su}(K)$ Lie-Poisson algebra provides the framework needed to understand symplecticity of the Spin-MInt algorithm in this general case. The symplecticity of the method on the associated coadjoint orbit is then shown for what we believe to be the first time via an explicit verification of the symplecticity condition $\mathbf{MJ}\mathbf{M}^\textrm{T}=\mathbf{J}$ exploiting the Lie-Poisson structure of the system. To our knowledge, this is the first time the monodromy matrix for the Spin-MInt algorithm has been explicitly stated using canonical coordinates on the coherent state manifold for a general number of states. We hope that this will assist the development of classical-like spin-mapping methods which might utilise elements of the monodromy matrix, and inform future work on similar symplectic algorithms for coupled and uncoupled Lie-Poisson systems.

physics.chem-phCross-listedarXiv:2607.02058•Jul 3, 2026

Quantum symplectic structure

WORLD SCIENTIFIC eBooks•Aug 1, 2001•0 citations

Symplectic invariant method for time-dependent quadratic Hamiltonians

Charles Antoine

\n\nUsing the ABCD formalism of atom optics, the generating function method and the invariant operator method (Liouville-von Neumann picture), I show in this letter how the quantum time evolution of any wave packet can be entirely determined by a natural symplectic invariant, which provides both the (non-Hermitian) invariant operator and the adequate eigenvalue. Within this framework, the quantum propagator does not appear any more as the fundamental kernel of integration but merely as a particular property of this invariant operator. The symplectic invariant method is interpreted in terms of creation/annihilation operators of N-dimensional Hermite-Gaussian modes.\n

Europhysics Letters (EPL)•Nov 1, 2012•0 citations

Semiclassical coherent-states propagator

Alejandro M. F. Rivas

In this work, we derived a semiclassical approximation for the matrix elements of a quantum propagator in coherent states (CS) basis that avoids complex trajectories; it only involves real ones. For that purpose, we used the symplectically invariant semiclassical Weyl propagator obtained by performing a stationary phase approximation (SPA) for the path integral in the Weyl representation. After that, for the transformation to CS representation SPA is avoided; instead a quadratic expansion of the complex exponent is used. This procedure also allows us to express the semiclassical CS propagator uniquely in terms of the classical evolution of the initial point without the need of any root search typical of van Vleck--Gutzwiller-based propagators. For the case of chaotic Hamiltonian systems, the explicit time dependence of the CS propagator has been obtained. The comparison with a realistic chaotic system that derives from a quadratic Hamiltonian, the cat map, reveals that the expression here derived is exact up to quadratic Hamiltonian systems.

arXiv:1207.0012•Physical Review A•Jul 8, 2013•3 citations

Symplectic Quantum Structure

Kay-Michael Voit

•Jan 1, 2008•0 citations
Mapping methods are often used for the numerical simulation of nonadiabatic systems by propagating classical mapping variable trajectories. A recently popularised mapping method is spin-mapping, whose mapping variables arise from quantum mechanical operators with symmetries described by a Lie-Poisson algebra. Simulating the classical-like dynamics of spin-mapping systems accurately is generally challenging, with many methods unable to preserve the underlying geometric structure of the symplectic form. The Spin-MInt algorithm is a recently proposed algorithm propagating spin-mapping variables, with a direct proof of symplecticity existing only for 2 electronic states. Here, we directly prove the symplecticity of the Spin-MInt algorithm for a general KKK electronic states. A review of the symplectic nature of coadjoint orbits of the su(K)\mathfrak{su}(K)su(K) Lie-Poisson algebra provides the framework needed to understand symplecticity of the Spin-MInt algorithm in this general case. The symplecticity of the method on the associated coadjoint orbit is then shown for what we believe to be the first time via an explicit verification of the symplecticity condition MJMT=J\mathbf{MJ}\mathbf{M}^\textrm{T}=\mathbf{J}MJMT=J exploiting the Lie-Poisson structure of the system. To our knowledge, this is the first time the monodromy matrix for the Spin-MInt algorithm has been explicitly stated using canonical coordinates on the coherent state manifold for a general number of states. We hope that this will assist the development of classical-like spin-mapping methods which might utilise elements of the monodromy matrix, and inform future work on similar symplectic algorithms for coupled and uncoupled Lie-Poisson systems.
\n\nUsing the ABCD formalism of atom optics, the generating function method and the invariant operator method (Liouville-von Neumann picture), I show in this letter how the quantum time evolution of any wave packet can be entirely determined by a natural symplectic invariant, which provides both the (non-Hermitian) invariant operator and the adequate eigenvalue. Within this framework, the quantum propagator does not appear any more as the fundamental kernel of integration but merely as a particular property of this invariant operator. The symplectic invariant method is interpreted in terms of creation/annihilation operators of N-dimensional Hermite-Gaussian modes.\n
In this work, we derived a semiclassical approximation for the matrix elements of a quantum propagator in coherent states (CS) basis that avoids complex trajectories; it only involves real ones. For that purpose, we used the symplectically invariant semiclassical Weyl propagator obtained by performing a stationary phase approximation (SPA) for the path integral in the Weyl representation. After that, for the transformation to CS representation SPA is avoided; instead a quadratic expansion of the complex exponent is used. This procedure also allows us to express the semiclassical CS propagator uniquely in terms of the classical evolution of the initial point without the need of any root search typical of van Vleck--Gutzwiller-based propagators. For the case of chaotic Hamiltonian systems, the explicit time dependence of the CS propagator has been obtained. The comparison with a realistic chaotic system that derives from a quadratic Hamiltonian, the cat map, reveals that the expression here derived is exact up to quadratic Hamiltonian systems.