Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.09248 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Accurate computation of the Green's function is crucial for connecting experimental observations to the underlying quantum states. A major challenge in evaluating the Green's function in the time domain lies in the efficient simulation of quantum state evolution under a given Hamiltonian-a task that becomes exponentially complex for strongly correlated systems on classical computers. Quantum computing provides a promising pathway to overcome this barrier by enabling efficient simulation of quantum dynamics. However, for near-term quantum devices with limited coherence times and fidelity, the deep quantum circuits required to implement time-evolution operators present a significant challenge for practical applications. In this work, we introduce an efficient algorithm for computing Green's functions via Cartan decomposition, which requires only fixed-depth quantum circuits for arbitrarily long time simulations. Additionally, analytical gradients are formulated to accelerate the Cartan decomposition by leveraging a unitary transformation in a factorized form. The new algorithm is applied to simulate long-time Green's functions for the Fermi-Hubbard and transverse-field Ising models, extracting the spectral functions through Fourier transformation.