Toward a resource-optimized dynamic quantum algorithm via non-iterative auxiliary subspace corrections

Recent quantum algorithms pertaining to electronic structure theory primarily focus on the threshold-based dynamic construction of ansatz by selectively including important many-body operators. These methods can be made systematically more accurate by tuning the threshold to include a greater number of operators into the ansatz. However, such improvements come at the cost of rapid proliferation of the circuit depth, especially for highly correlated molecular systems. In this work, we address this issue by the development of a novel theoretical framework that relies on the segregation of an ansatz into a dynamically selected core "principal" component, which is, by construction, adiabatically decoupled from the remaining operators. This enables us to perform computations involving the principal component using extremely shallow-depth circuits, whereas the effect of the remaining "auxiliary" component is folded into the energy function via a cost-efficient non-iterative correction, ensuring the requisite accuracy. We propose a formalism that analytically predicts the auxiliary parameters from the principal ones, followed by a suite of non-iterative auxiliary subspace correction techniques with different levels of sophistication. The auxiliary subspace corrections incur no additional quantum resources yet complement an inadequately expressive core of the ansatz to recover a significant amount of electronic correlations. We have numerically validated the resource efficiency and accuracy of our formalism with a number of strongly correlated molecular systems.