aiqbench analysis
This research presents a novel computational technique for extracting resonance pole positions in scattering problems, optimizing performance on both classical and quantum hardware without relying on non-Hermitian Hamiltonian extensions. By leveraging unitary time evolution of persistent states and gate-based quantum implementations via the Rodeo algorithm, the study demonstrates significant convergence improvements with system size, offering a promising pathway for solving complex few-body physics problems in future quantum computing architectures.
Persistent State Method for Resonances on Classical and Quantum Computers
arXiv:2609.25164v1 Announce Type: cross 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.
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.
arXiv:2609.25164 [nucl-th]
(or arXiv:2609.25164v1 [nucl-th] for this version)
https://doi.org/10.48550/arXiv.2609.25164 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
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 · 209 words
Related coverage

News
Quantum Computing Report · Jun 7, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026

Quantum Measurement, How Reading a Qubit Works
Quantum Zeitgeist · Sep 5, 2026

Researchers Find Dark States Boost Spin-Ensemble Memory
Quantum Zeitgeist · Aug 27, 2026