A scalable sample-based quantum diagonalization solver for general Pauli-sum Hamiltonians

A scalable ground-state solver to be used in sample-based quantum diagonalization (SQD) is presented. The solver is built on JAX API, and is intended to be run on GPU platforms and possibly many-GPU high-performance computing facilities. It is capable of subspace diagonalization in up to $2^{30}$-dimensional subspace, with possible upgrades to enable even larger-scale operations. The two main components, a general-purpose eigensolver and an SQD-specific matrix-vector operation function, are described in detail. Efficiency of the eigensolver with respect to the GPU memory is demonstrated using a simple physics model. Furthermore, good strong scaling of the eigensolver in many-GPU environment is observed.

Source: arXiv:2610.13907v1 - http://arxiv.org/abs/2610.13907v1 PDF: https://arxiv.org/pdf/2610.13907v1 Original Link: http://arxiv.org/abs/2610.13907v1