aiqbench analysis
This research advances quantum simulation by refining Lie-theoretic methods to approximate time-evolution operators on near-term hardware with reduced gate counts and constant circuit depth. By incorporating second-order Zassenhaus corrections into Cartan/KAK decompositions, the approach offers a more efficient pathway for compiling complex Hamiltonians from lattice or chemistry models without explicit matrix exponentiation.
Zassenhaus Expansion in Solving the Schr\"odinger Equation
arXiv:2505.09441v2 Announce Type: replace Abstract: A fundamental challenge in quantum simulation is approximating the time-evolution operator \(U(t)=e^{-i\mathcal{H}t}\) generated by a large sum of typically non-commuting Hamiltonians using resource-efficient circuits compatible with near-term devices. We present a refinement of fixed-depth Lie-theoretic simulation that incorporates second-order Zassenhaus commutator corrections into a Cartan/KAK decomposition template. The resulting approximation retains constant circuit depth while achieving local error \(\mathcal{O}(t^3)\) in operator norm under standard boundedness assumptions, and it substantially reduces gate counts relative to first-order product formulas when time is large and depth is constrained. The method leverages closure of Pauli commutators inside Pauli-generated Lie algebras, enabling symbolic commutator evaluation and avoiding explicit matrix exponentiation in classical preprocessing. This yields a structured pathway to compile lattice and chemistry-inspired Hamiltonians with locality constraints into fixed-depth circuits suitable for noisy intermediate-scale quantum hardware.
Abstract:A fundamental challenge in quantum simulation is approximating the time-evolution operator \(U(t)=e^{-i\mathcal{H}t}\) generated by a large sum of typically non-commuting Hamiltonians using resource-efficient circuits compatible with near-term devices. We present a refinement of fixed-depth Lie-theoretic simulation that incorporates second-order Zassenhaus commutator corrections into a Cartan/KAK decomposition template. The resulting approximation retains constant circuit depth while achieving local error \(\mathcal{O}(t^3)\) in operator norm under standard boundedness assumptions, and it substantially reduces gate counts relative to first-order product formulas when time is large and depth is constrained. The method leverages closure of Pauli commutators inside Pauli-generated Lie algebras, enabling symbolic commutator evaluation and avoiding explicit matrix exponentiation in classical preprocessing. This yields a structured pathway to compile lattice and chemistry-inspired Hamiltonians with locality constraints into fixed-depth circuits suitable for noisy intermediate-scale quantum hardware.
12pp. New authors
arXiv:2505.09441 [quant-ph]
(or arXiv:2505.09441v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2505.09441 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 223 words
Related coverage
Smart Machine Learning for Solving the Full Electron-Nuclear Schr\"odinger Equation with a Quantum-Chemically Inspired Wavefunction Ansatz
arXiv · Oct 1, 2026
Localized states of the non-Hermitian Schr{\"o}dinger equation with a complex $1/r^{2}$ potential: from Efimov states to bipolarons
arXiv · Oct 16, 2026
Continuous-Time Quantum Markov Chains And Discretizations Of p-Adic Schr\"odinger Equations: Comparisons And Simulations
arXiv · Aug 20, 2026
Linear combination of Schr\"odingerization for quantum linear systems with optimal matrix-query complexity
arXiv · Sep 18, 2026