Dense-sparse quantum Monte Carlo algebraic diagrammatic construction and importance ranking

Abstract

Quantum Monte Carlo Algebraic Diagrammatic Construction (QMCADC) has been proposed as a reformulation of the second-order ADC scheme for the polarization propagator within the projection quantum Monte Carlo formalism. Dense-sparse partitioning and importance ranking filtering strategies are now exploited to accelerate its convergence and to alleviate the sign problem inherent in such calculations. By splitting the configuration space into dense and sparse subsets, the corresponding projection operator is decomposed into four distinct blocks. Deterministic calculations handle the dense-to-dense and sparse-to-dense blocks, while the remaining blocks, dense-to-sparse and sparse-to-sparse, are stochastically evaluated. The dense set is efficiently stored in a fixed-size array, and the sparse set is represented through conventional floating random Monte Carlo walks. The stochastic projection is further refined through importance ranking criteria, enabling a reduction in the required number of walkers with a controllable bias. Our results demonstrate the integration of dense-sparse partitioning with importance ranking filtering to significantly enhance the efficiency of QMCADC, enabling large-scale molecular excited-state calculations. Furthermore, this novel approach maximizes the utilization of the sparsity of ADC(2), transforming QMCADC into a tailored framework for ADC calculations.