No core Full Configurational Interaction (NCFCI) calculations of Nuclear Bonding energy are resource demanding, in particular, computational time scales exponentially with the nucleon number A. In contrast to that, usage of quantum computers would allow an efficient (in polynomial time) NCFCI calculation and speed-up for other beyond-Mean-Field (correlation energy including) methods. To initiate feasibility studies of given quantum algorithms, we present an introduction to preliminary classicalcomputer simulation for the case of spherical nuclei (and 4He in particular) within NCFCI with realistic chiral NNLO_opt potential.
No core Full Configurational Interaction (NCFCI) calculations of Nuclear Bonding energy are resource demanding, in particular, computational time scales exponentially with the nucleon number A. In contrast to that, usage of quantum computers would allow an efficient (in polynomial time) NCFCI calculation and speed-up for other beyond-Mean-Field (correlation energy including) methods. To initiate feasibility studies of given quantum algorithms, we present an introduction to preliminary classicalcomputer simulation for the case of spherical nuclei (and 4He in particular) within NCFCI with realistic chiral NNLO_opt potential.
Accurate calculations of nuclear binding energies in theory is a long-standing problem in nuclear physics, as it provides critical insights the effective interactions and structures of atomic nuclei. Currently, there are severe limitations in theory due to the exponential growth of the Hilbert space with increasing nucleon number, i.e., curse of the dimension. There are some effort to mitigate this problem by using the state-of-art methods, such as the machine learning and quantum computing. Recent advances in quantum computing have opened new avenues for addressing these challenges, enabling the direct simulation of nuclear many-body systems on quantum hardware. In this work, a detailed study on the calculation of nuclear binding energies using the full quantum eigensolver (FQE) algorithm, implemented on a real quantum processor, i.e. Quafu, was presented. Two nuclear systems (2H and 6He) were investigated. The deuteron, as the simplest bound nucleus with just one proton and one neutron, serves as an ideal benchmark for testing quantum algorithms, FQE. 6He, a light, two-valence neutron nucleus, was used for estimating the ability of the Quafu quantum cloud platform and its “Baihua” quantum chip. Our results demonstrate that for the deuteron, the FQE algorithm on the “Baihua” quantum processor achieves a higher level of accuracy compared to previously reported results obtained using the variational quantum eigensolver (VQE) on the IBM_QX5 and IBM_19Q platforms, as discussed in Dumitrescu’s article. For 6He, the FQE-calculated binding energy shows accuracy comparable to recent VQE-based calculations reported in Yoshida’s article. These findings highlight the feasibility of performing precise nuclear structure calculations on near-term quantum devices and underscore the potential of the FQE approach for future applications in nuclear physics. Overall, this study extends the scope of quantum computing in nuclear physics by demonstrating that the FQE algorithm can serve as a practical and accurate tool for computing binding energies on real quantum hardware. The results provide a benchmark for future developments in quantum simulations of nuclei and suggest promising directions for scaling these methods to larger nuclear systems, ultimately contributing to a deeper understanding of nuclear structure and dynamics.
While quantum algorithms have been studied as an efficient tool for the stationary state energy determination in the case of molecular quantum systems, no similar study for analogical problems in computational nuclear physics (computation of energy levels of nuclei from empirical nucleon-nucleon or quark-quark potentials) have been realized yet. Although the difference between the above mentioned studies might seem negligible, it will be examined. First steps towards a particular simulation (on classical computer) of the Iterative Phase Estimation Algorithm for deuterium and tritium nuclei energy level computation will be carried out with the aim to prove algorithm feasibility (and extensibility to heavier nuclei) for its possible practical realization on a real quantum computer.
We discuss computational aspects of the spherical coupled-cluster method specific to the nuclear many-body problem. Using chiral nucleon-nucleon interaction at next-to-next-to-next-to leading order (N3LO) with cutoff Λ = 500MeV, we present coupled-cluster results for the ground state of 40Ca. Scaling and performance studies are presented together with challenges we meet with when extending the coupled-cluster effort to nuclei mass hundred and beyond. The low-energy nuclear many-body problem is a challenging undertaking, how-ever, in the last decade there has been significant progress in first principle cal-culations of nuclei.1), 2), 3), 4), 5), 6), 7), 8), 9) With the advance of chiral effective field theory10), 11), 12), 13), 14), 15) which allows for a systematic and consistent derivation of
Abstract With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron–nucleus simulations with general potentials, which provides acceptable bound-state energies even in the presence of noise, through the noise-resilient (NR) training method. In particular, the algorithm can now solve for any band-diagonal to full Hamiltonian matrices, as needed to accommodate a general central potential. While we illustrate the approach for exponential Gaussian-like potentials and ab initio inter-cluster potentials (optical potentials), it can also accommodate the complete form of the chiral effective-field-theory nucleon–nucleon potentials used in ab initio nuclear calculations. In this study, we provide a comprehensive analysis for the efficacy of this approach for three different qubit encodings, including the one-hot, binary, and Gray encodings, in terms of the number of Pauli strings and commuting sets involved. We also discuss the advantages of the algorithm for Hamiltonians of various band-diagonal widths, especially critical for potentials of perturbative nature, leading to a drastically reduced runtime of quantum simulations. We prove that the Gray encoding allows for an efficient scaling of the model-space size N (or number of basis states used) and is more resource efficient for band-diagonal Hamiltonians having bandwidth up to N . We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity (QC) scheme. We lay out the explicit grouping of Pauli strings and the diagonalizing unitary under the DGC scheme, and we prove that it outperforms the QC scheme, at the cost of a more complex diagonalizing unitary. Lastly, we provide first solutions of the neutron–alpha dynamics from quantum simulations suitable for noisy intermediate-scale quantum processors, using an optical potential rooted in first principles, as well as a study of the bound-state physics in neutron–Carbon systems, along with a comparison of the efficacy of the one-hot and Gray encodings.
To maximize the value of fault-tolerant quantum computers, it is essential to develop concrete applications beyond well-established domains such as chemistry and condensed-matter physics. Here we construct and compile quantum algorithms to simulate the structure of atomic nuclei -- a topic that has received relatively little attention from the quantum computing community despite its similarities to the electronic structure problem in chemistry -- via effective shell-model Hamiltonians and no-core-shell-model Hamiltonians with three-body interactions derived from chiral effective field theory. Furthermore, we provide quantum resource estimates, in terms of Toffoli gate and qubit counts, for these algorithms, which, to our knowledge, are the first such estimates for fault-tolerant quantum simulation of atomic nuclei. Notably, the estimates for 32Mg and 219At shell-model Hamiltonians are comparable to recent estimates of Femoco simulations, a standard benchmark in chemistry. For no-core-shell-model Hamiltonians suitable for light nuclei (up to 40Ca or so), we find that resource requirements are significantly higher, suggesting that more bespoke strategies are required to make such simulations practicable. Throughout this work, we draw upon the similarities between nuclear and electronic structure problems, while also highlighting challenges that are specific to the former. We hope this work will spur long-term collaborations between the nuclear and quantum computing community with the ultimate goal of realizing useful nuclear simulations on quantum computers.
Full configuration interaction quantum Monte Carlo for accurate ab initio nuclear structure calculations: algorithms and calculation details
Full configuration interaction quantum Monte Carlo (FCIQMC) is a stochastic many-body solver that has been widely applied to electronic, molecular, and condensed-matter systems. In this work we apply FCIQMC to ab initio nuclear structure calculations using interactions derived from chiral effective field theory. We describe the algorithm in detail, including imaginary-time propagation, excitation generation, estimator choices, the initiator approximation with adaptive shift correction, and reduced-density-matrix (RDM) sampling. Benchmark calculations in small model spaces, where deterministic full configuration interaction (FCI) results are available, validate the stochastic calculation of energies, radii, and RDM-based pure estimators. For large model spaces, we analyze the residual finite-walker bias through systematic walker-number convergence and infinite-walker extrapolations. We also demonstrate that FCIQMC can be extended beyond ground-state calculations by computing the low-lying spectrum of 6Li.