Skip to content
DraconiticResearch
Search Sources API
181,713 studies31 sourcesUpdated 27 min ago
PreprintarXiv licencearXiv

Persistent State Method for Resonances on Classical and Quantum Computers

  • Cong-Wu Wang
  • Lukas Bovermann
  • Evgeny Epelbaum
  • Hermann Krebs
  • Dean Lee
  • Yu-Gang Ma
  • Avik Sarkar
Open at sourcePDFDOICite

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.

Related

  1. Grow, Compress, and Perturb: A Hybrid Quantum-Classical Pathway to Scalable Quantum Chemistry on Quantum Computers
    Hugo D. Nogueira, Siwar Badreddine, Olivier Adjoua +3
    HALPreprintCC BY 4.0Full textPhysical chemistryTheoretical & computational chemistryHALarXiv
  2. Quantum-Classical Fragmentation with the Effective Fragment Molecular Orbital Method
    Federico Zahariev, Vassiliki-Alexandra Glezakou, Mark S. Gordon
    arXivPreprintCC BY 4.0Full textPhysical chemistryQuantum physics & quantum informationarXiv
  3. Quantum WalkScore: Benchmarking Quantum Computers on the Graph Nodefinding Problem
    Noé Olivier, Michel Nowak
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  4. Local thermalization of SU(2) lattice gauge fields on quantum computers
    Jiunn-Wei Chen, Yu-Ting Chen, Ghanashyam Meher +3
    Journal of High Energy PhysicsPeer-reviewedCC BY 4.0Full textAtomic, molecular & optical physicsCrossref
  5. Quantum computers will not be that different: A blueprint for quantum computer architecture at scale
    Torsten Hoefler, Matthias Troyer
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv

Cite

BibTeXRIS
BibTeX
@misc{wang2026persistent,
  title = {{Persistent State Method for Resonances on Classical and Quantum Computers}},
  author = {Cong-Wu Wang and Lukas Bovermann and Evgeny Epelbaum and Hermann Krebs and Dean Lee and Yu-Gang Ma and Avik Sarkar},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.25164},
  eprint = {2609.25164},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.25164},
}
RIS
TY  - UNPB
TI  - Persistent State Method for Resonances on Classical and Quantum Computers
AU  - Cong-Wu Wang
AU  - Lukas Bovermann
AU  - Evgeny Epelbaum
AU  - Hermann Krebs
AU  - Dean Lee
AU  - Yu-Gang Ma
AU  - Avik Sarkar
PY  - 2026
DA  - 2026/09/21
PB  - arXiv
DO  - 10.48550/arxiv.2609.25164
UR  - https://arxiv.org/abs/2609.25164
AB  - 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.
ER  -