An efficient algorithm for computing the Baker-Campbell-Hausdorff series and some of its applications
arXiv:0810.2656 · doi:10.1063/1.3078418
Abstract
We provide a new algorithm for generating the Baker--Campbell--Hausdorff (BCH) series $Z = \log(\e^X \e^Y)$ in an arbitrary generalized Hall basis of the free Lie algebra generated by and . It is based on the close relationship of with a Lie algebraic structure of labeled rooted trees. With this algorithm, the computation of the BCH series up to degree 20 (111013 independent elements in ) takes less than 15 minutes on a personal computer and requires 1.5 GBytes of memory. We also address the issue of the convergence of the series, providing an optimal convergence domain when and are real or complex matrices.
30 pages
References in corpus (5)
Cited by in corpus (29)
- Efficient computation of the Zassenhaus formula
- New families of symplectic splitting methods for numerical integration in dynamical astronomy
- Splitting and composition methods in the numerical integration of differential equations
- ABJM Wilson loops in the Fermi gas approach
- Lattice Renormalization of Quantum Simulations
- Special-case closed form of the Baker-Campbell-Hausdorff formula
- Characterization and Verification of Trotterized Digital Quantum Simulation via Hamiltonian and Liouvillian Learning
- Causal State Updates in Real Scalar Quantum Field Theory
- Explicit Baker-Campbell-Hausdorff formulae for some specific Lie algebras
- The iisignature library: efficient calculation of iterated-integral signatures and log signatures
- Momentum dependent quantum Ruelle-Pollicott resonances in translationally invariant many-body systems
- Calculation of Iterated-Integral Signatures and Log Signatures
- On expansions for nonlinear systems, error estimates and convergence issues
- Unified Signature Cumulants and Generalized Magnus Expansions
- Exact Baker-Campbell-Hausdorff formula for the contact Heisenberg algebra
- On the Baker-Campbell-Hausdorff Theorem: non-convergence and prolongation issues
- Simplifying the Reinsch algorithm for the Baker-Campbell-Hausdorff series
- Convergence of the Gutt Star Product
- The Scaling, Splitting and Squaring Method for the Exponential of Perturbed Matrices
- Self--averaging of random quantum dynamics
- On the structure and convergence of the symmetric Zassenhaus formula
- Overview of (pro-)Lie group structures on Hopf algebra character groups
- Finite Type Invariants of w-Knotted Objects IV: Some Computations
- Convergence estimates for the Magnus expansion III. Banach--Lie algebras
- Geometry of Classical Nambu-Goldstone Fields
- Prethermalization, shadowing breakdown, and the absence of Trotterization transition in quantum circuits
- Magnus-Zassenhaus methods for the semiclassical Schrödinger equation with oscillatory time-dependent potentials
- User manual for bch, a program for the fast computation of the Baker-Campbell-Hausdorff and similar series
- A note on trigonometric identities involving non-commuting matrices