2025/12/14 by B. Maheshwari, P. Stevenson, Maheshwari, Bhoomika +3 · 2 voices
Computer Science · Physics and Astronomy · #Nuclear physics research studies #Quantum Computing Algorithms and Architecture #Quantum many-body systems
paper · doi:10.5506/aphyspolbsupp.19.1-a2
openalex created_date 2025/12/24 · openalex publication_date 2026/03/31 · openalex updated_date 2026/07/02
Quantum computing offers a scalable approach to solving the nuclear shell model, a highly complex and exponentially scaled many-body problem. This work presents a numerical simulation of the subspace search variational quantum eigensolver (SSVQE) combined with an adaptive derivative-assemble pseudo-trotter (ADAPT) ansatz to obtain the low-lying states of any nuclear system in a single optimization run. As an example, we apply this method in this work to a trivial identical nucleon system, two nucleons in the \(0p3/2\) orbital, mapped to 4 qubits depicting \(m\)-scheme single-particle states including a surface delta effective interaction using the Jordan–Wigner transformation. The ADAPT-SSVQE algorithm, by utilizing a symmetry-preserving double-excitation ADAPT operator pool, uniquely optimizes a weighted energy sum, forcing the simultaneous convergence of the two lowest states within the total angular momentum \(MJ=0\) subspace. We demonstrate the accuracy of the method by benchmarking against the exact diagonalization, confirming its potential for probing nuclear structure, and pairing phenomena on current and near-future quantum devices without requiring a multi-step procedure for excited states. Abstract Published by the Jagiellonian University 2026 authors