Error bounds for the truncated Baker--Campbell--Hausdorff and Zassenhaus formulas in unitary problems

• URL: http://arxiv.org/abs/2607.07692v1
• Date: Wed, 08 Jul 2026 17:49:46 GMT
• Title: Error bounds for the truncated Baker--Campbell--Hausdorff and Zassenhaus formulas in unitary problems
• Abstract summary: We present a strategy to derive rigorous error bounds and explicit error constants for the BCH and Zassenhaus formulas.<n>In this work we present a general strategy to derive rigorous error bounds and explicit error constants for the BCH and Zassenhaus formulas.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Baker--Campbell--Hausdorff (BCH) formula plays a critical role in many branches of mathematics and physics. It expresses the logarithm of the product of exponentials of non-commuting operators as an infinite series of nested commutators of the operators involved. The Zassenhaus formula is the dual of the BCH formula: the exponential of a sum of operators is written as an infinite product of exponentials involving the operators and their commutators. In practical computations, however, one typically has to truncate the expansions, and so understanding the error committed by the resulting approximations and eventually providing suitable bounds for this error is of paramount interest. In this work we present a general strategy to derive rigorous error bounds and explicit error constants for the BCH and Zassenhaus formulas when the operators involved are skew-adjoint, as is the case for quantum evolution problems.

Related papers

• Neural operators approximate strongly continuous convex monotone semigroups [41.99844472131922]
  We approximate strongly continuous monotone convex semigroups by learning their Chernoff-type one-step operators with neural operators.<n>We show in a universal approximation theorem that they can approximate the Chernoff one-step operators arbitrarily well.
  arXiv  Detail & Related papers  (2026-09-02T15:38:52Z)
• Feynman's linear divergence problem [45.88028371034407]
  We construct secondary generalized scattering operators for the related case of linear divergence in QED.<n>This gives a positive answer to the well-known problem of J. R. Oppenheimer regarding scattering operators in QED.
  arXiv  Detail & Related papers  (2026-04-13T15:19:27Z)
• Error bounds for splitting methods in unitary problems [45.88028371034407]
  We present a systematic analysis of both local and global errors arising from arbitrary splitting methods applied to unitary problems.<n>The first is expressed in terms of operator norms, while the second is formulated using norms of commutators and can, under suitable assumptions, be extended to certain classes of operators.
  arXiv  Detail & Related papers  (2026-04-01T15:33:05Z)
• Linear combination of unitaries with exponential convergence [0.0]
  We present a general method for decomposing non-unitary operators into a linear combination of unitary operators.<n>When implemented in a quantum circuit, the subnormalisation of the resulting block encoding scales with the double logarithm of the inverse error.
  arXiv  Detail & Related papers  (2026-01-25T22:47:21Z)
• Sheffer Polynomials and the s-ordering of Exponential Boson Operators [0.0]
  S-ordering concept originated in quantum optics, and subsumes normal, symmetric, and anti-normal ordering.<n>S-ordered expressions are derived with the aid of a parametric family of Sheffer sequences.
  arXiv  Detail & Related papers  (2025-08-18T17:05:40Z)
• Revisiting the operator extension of strong subadditivity [44.33169165028139]
  We give a new proof of the operator extension of the strong subadditivity of von Neumann entropy $rho_AB otimes sigma_C-1 leq rho_A otimes sigma_BC-1$ by identifying the mathematical structure behind it as Connes' theory of spatial derivatives.
  arXiv  Detail & Related papers  (2025-07-30T14:18:43Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Generalization of Balian-Brezin decomposition for exponentials with linear fermionic part [0.0]
  We extend Balian and Brezin's work to incorporate Gaussian operators with a linear component. We also extend Wick's theorem to encompass scenarios involving linear terms.
  arXiv  Detail & Related papers  (2023-06-23T12:39:16Z)
• General expansion of natural power of linear combination of Bosonic operators in normal order [3.42658286826597]
  We present a general expansion of the natural power of a linear combination of bosonic operators in normal order. Our results have important applications in the study of many-body systems in quantum mechanics.
  arXiv  Detail & Related papers  (2023-05-29T14:26:45Z)
• Representation of the Fermionic Boundary Operator [10.522527427240352]
  We consider the problem of representing the full boundary operator on a quantum computer. We first prove that the boundary operator has a special structure in the form of a complete sum of fermionic creation and annihilation operators. We then use the fact that these operators pairwise anticommute to produce an $O(n)$-depth circuit that exactly implements the boundary operator without any Trotterization or Taylor series approximation errors.
  arXiv  Detail & Related papers  (2022-01-27T13:42:57Z)
• Models of zero-range interaction for the bosonic trimer at unitarity [91.3755431537592]
  We present the construction of quantum Hamiltonians for a three-body system consisting of identical bosons mutually coupled by a two-body interaction of zero range. For a large part of the presentation, infinite scattering length will be considered.
  arXiv  Detail & Related papers  (2020-06-03T17:54:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.