The QCSH finds the eigenvalue through iteration quickly. As shown in Fig. REF , it takes less than 20 iteration to reach the ground state. We compared the results of QCSH with the exact diagonalization of the noiseless Hamiltonian in a classical computer. The classical exact results are given as Diagonalization in Fig. REF . The results of our quantum algorithm without noise are consistent with classic diagonalization. For cases with a given strength of noise, the results of QCSH converge to the exact energy of diagonalization within an error of about 1 KeV, which is within the accuracy for nuclear structure physics. In fact, QCSH converges more quickly if the initial states are taken as Hartree-Fock state [1]}. This noise analysis demonstrated that QCSH is robust against noises, and is very promising to be realized in NISQ quantum computers in the near future.
<FIGURE>