Zassenhaus Expansion in Solving the Schrödinger Equation

• URL: http://arxiv.org/abs/2505.09441v1
• Date: Wed, 14 May 2025 14:48:47 GMT
• Title: Zassenhaus Expansion in Solving the Schrödinger Equation
• Authors: Molena Nguyen, Naihuan Jing,
• Abstract summary: A fundamental challenge lies in approximating the unitary evolution operator ( e-imathcalHt ) where ( mathcalH ) is a large, typically non-commuting, Hermitian operator.<n>We present a refinement of the fixed-depth simulation framework introduced by E. K"okc"u et al, incorporating the second-order Zassenhaus expansion.<n>This yields a controlled, non-unitary approximation with error scaling as ( mathcalO(t
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hamiltonian simulation is a central task in quantum computing, with wide-ranging applications in quantum chemistry, condensed matter physics, and combinatorial optimization. A fundamental challenge lies in approximating the unitary evolution operator \( e^{-i\mathcal{H}t} \), where \( \mathcal{H} \) is a large, typically non-commuting, Hermitian operator, using resource-efficient methods suitable for near-term devices. We present a refinement of the fixed-depth simulation framework introduced by E. K\"okc\"u et al, incorporating the second-order Zassenhaus expansion to systematically factorize the time evolution operator into a product of exponentials of local Hamiltonian terms and their nested commutators, truncated at second order. This yields a controlled, non-unitary approximation with error scaling as \( \mathcal{O}(t^3) \), preserving constant circuit depth and significantly reducing gate counts compared to first-order Trotterization. Unlike higher-order Trotter or Taylor methods, our approach algebraically isolates non-commutative corrections and embeds them into a depth-independent ansatz. We further exploit the quaternary structure and closure properties of Lie subalgebras to evaluate commutators analytically, circumventing explicit matrix exponentiation and reducing classical preprocessing overhead. This enables efficient simulation of Hamiltonians with bounded operator norm and structured locality, including those encountered in realistic quantum chemistry and spin-lattice models. Our method retains simulation fidelity while relaxing strict unitarity constraints, offering a scalable and accurate framework for fixed-depth quantum simulation on noisy intermediate-scale quantum (NISQ) hardware.

Related papers

• Classical simulation of parity-preserving quantum circuits [0.0]
  We present a classical simulation method for fermionic quantum systems without loss of generality.<n>We map such circuits to a fermionic tensor network and introduce a novel decomposition of non-Matchgate gates.<n>Our algorithm significantly lowers resource requirements for simulating parity-preserving circuits while retaining high accuracy.
  arXiv  Detail & Related papers  (2025-04-27T17:42:39Z)
• Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization [38.59115551211364]
  Existing compilation techniques for Hamiltonian simulation struggle to provide gate counts feasible on current quantum computers.<n>We propose partial Trotterization, where sets of non-commuting Hamiltonian terms are directly compiled allowing for less error per Trotter step.<n>We demonstrate with numerical simulations across spin and fermionic Hamiltonians that compared to state of the art methods such as Qiskit's Rustiq and Qiskit's Paulievolutiongate, our novel compiler presents up to 10x gate and depth count reductions.
  arXiv  Detail & Related papers  (2025-04-09T18:41:31Z)
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation [3.5148549831413036]
  We provide the first superconvergence estimate in the fully discrete setting with a finite number of spatial discretization points $N$.<n>We establish a semiclassical framework by identifying two parameters through the discretization number and the time step size rescaled by the operator norm.
  arXiv  Detail & Related papers  (2025-02-27T16:43:28Z)
• Schrödingerization based Quantum Circuits for Maxwell's Equation with time-dependent source terms [24.890270804373824]
  This paper explicitly constructs a quantum circuit for Maxwell's equations with perfect electric conductor (PEC) boundary conditions. We show that quantum algorithms constructed using Schr"odingerisation exhibit acceleration in computational complexity compared to the classical Finite Difference Time Domain (FDTD) format.
  arXiv  Detail & Related papers  (2024-11-17T08:15:37Z)
• Gauge-Fixing Quantum Density Operators At Scale [0.0]
  We provide theory, algorithms, and simulations of non-equilibrium quantum systems.<n>We analytically and numerically examine the virtual freedoms associated with the representation of quantum density operators.
  arXiv  Detail & Related papers  (2024-11-05T22:56:13Z)
• Projective Quantum Eigensolver with Generalized Operators [0.0]
  We develop a methodology for determining the generalized operators in terms of a closed form residual equations in the PQE framework. With the application on several molecular systems, we have demonstrated our ansatz achieves similar accuracy to the (disentangled) UCC with singles, doubles and triples.
  arXiv  Detail & Related papers  (2024-10-21T15:40:22Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• On optimization of coherent and incoherent controls for two-level quantum systems [77.34726150561087]
  This article considers some control problems for closed and open two-level quantum systems. The closed system's dynamics is governed by the Schr"odinger equation with coherent control. The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
  arXiv  Detail & Related papers  (2022-05-05T09:08:03Z)
• Hybridized Methods for Quantum Simulation in the Interaction Picture [69.02115180674885]
  We provide a framework that allows different simulation methods to be hybridized and thereby improve performance for interaction picture simulations. Physical applications of these hybridized methods yield a gate complexity scaling as $log2 Lambda$ in the electric cutoff. For the general problem of Hamiltonian simulation subject to dynamical constraints, these methods yield a query complexity independent of the penalty parameter $lambda$ used to impose an energy cost.
  arXiv  Detail & Related papers  (2021-09-07T20:01:22Z)
• Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
  We present a constructive algorithm for generating quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
  arXiv  Detail & Related papers  (2021-04-01T19:06:00Z)
• Out-of-time-order correlations and the fine structure of eigenstate thermalisation [58.720142291102135]
  Out-of-time-orderors (OTOCs) have become established as a tool to characterise quantum information dynamics and thermalisation. We show explicitly that the OTOC is indeed a precise tool to explore the fine details of the Eigenstate Thermalisation Hypothesis (ETH) We provide an estimation of the finite-size scaling of $omega_textrmGOE$ for the general class of observables composed of sums of local operators in the infinite-temperature regime.
  arXiv  Detail & Related papers  (2021-03-01T17:51:46Z)
• Spectral Analysis of Product Formulas for Quantum Simulation [0.0]
  We show that the Trotter step size needed to estimate an energy eigenvalue within precision can be improved in scaling from $epsilon$ to $epsilon1/2$ for a large class of systems. Results partially generalize to diabatic processes, which remain in a narrow energy band separated from the rest of the spectrum by a gap.
  arXiv  Detail & Related papers  (2021-02-25T03:17:25Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)

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.