Comparison of variational quantum eigensolvers in light nuclei

Quantum computing is one of the most promising technologies of the near future, and the simulation of quantum many-body systems is a natural application. In this work, we present classical simulations of the ground states of light atomic nuclei within the <a:math xmlns:a="http://www.w3.org/1998/Math/MathML"> <a:mi>p</a:mi> </a:math> shell, from <b:math xmlns:b="http://www.w3.org/1998/Math/MathML"> <b:mmultiscripts> <b:mi>He</b:mi> <b:mprescripts/> <b:none/> <b:mn>6</b:mn> </b:mmultiscripts> </b:math> to <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"> <c:mmultiscripts> <c:mi mathvariant="normal">B</c:mi> <c:mprescripts/> <c:none/> <c:mn>10</c:mn> </c:mmultiscripts> </c:math> , calculated within the nuclear shell model. We compare the performance of two leading variational quantum eigensolver algorithms: the unitary coupled cluster (UCC) and the adaptive derivative-assembled pseudo-Trotter (ADAPT) methods, introducing a new metric to quantify the use of quantum resources in each simulation. We find that Slater determinants are the most useful reference states for both approaches. Our analysis suggests that ADAPT is more efficient for nuclei close to magic numbers, while UCC tends to require fewer resources toward the mid shell. This work lays the groundwork for robust benchmarking of quantum algorithms in nuclear structure studies.