Accelerated spin-adapted ground state preparation with non-variational quantum algorithms

TL;DR

This paper introduces a non-variational quantum algorithm that efficiently prepares spin-adapted ground states, reducing computational complexity from quartic to quadratic in the spin quantum number, validated by numerical experiments.

Contribution

It presents a two-step non-variational method for spin-adapted ground state preparation that lowers penalty term complexity from O(n_spin^4) to O(n_spin^2).

Findings

Significant reduction in gate complexity demonstrated.

Effective for spin-1/2 Heisenberg and manganese systems.

Validated through numerical experiments.

Abstract

Various methods have been explored to prepare the spin-adapted ground state, the lowest energy state within the Hilbert space constrained by externally specified values of the total spin magnitude and the spin-$z$ component. In such problem settings, variational and non-variational methods commonly incorporate penalty terms into the original Hamiltonian to enforce the desired constraints. While in variational approaches, only $O(n_{\textrm{spin}}^2)$ measurements are required for the calculation of the penalty terms for the total spin magnitude, non-variational approaches, such as probabilistic imaginary-time evolution or adiabatic time evolution, are expected to be more computationally intensive, requiring $O(n_{\textrm{spin}}^4)$ gates naively. This paper proposes a new procedure based on non-variational quantum algorithms to obtain the spin-adapted ground state. The proposed method consists of two steps: the first step is to prepare a spin-magnitude adapted state and the second step is post-processing for the desired $S_z$. By separating into two steps, the procedure achieves the desired spin-adapted ground state while reducing the number of penalty terms from $O(n_{\textrm{spin}}^4)$ to $O(n_{\textrm{spin}}^2)$. We conducted numerical experiments for spin-1/2 Heisenberg ring models and manganese trimer systems. The results confirmed the effectiveness of our method, demonstrating a significant reduction in gate complexity and validating its practical usefulness.