arXiv · 2609.25164
Persistent State Method for Resonances on Classical and Quantum Computers
Abstract
We introduce a new method for extracting resonance pole positions that does not require non-Hermitian extensions of a Hamiltonian. The complex resonance poles are extracted from unitary time evolution of a persistent state, a compact trial state chosen such that its survival amplitude is governed by a single exponential over an extended time window. We solve several two- and three-body systems interacting via short- and long-range forces on a lattice and show that the pole positions obtained using the persistent state method converge approximately exponentially with the linear size of the system. We also consider a gate-based quantum implementation of our method using the Rodeo algorithm and a Hamiltonian variational ansatz, and outline an extension to two-cluster scattering.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Cong-Wu Wang, Lukas Bovermann, Evgeny Epelbaum, Hermann Krebs, Dean Lee, Yu-Gang Ma, Avik Sarkar. 2026-09-21. Persistent State Method for Resonances on Classical and Quantum Computers. https://arxiv.org/abs/2609.25164
Cite the original work for its findings. Save a collection to share your selection of sources.