We present a cascaded variational quantum eigensolver algorithm that only requires the execution of a set of quantum circuits once rather than at every iteration during the parameter optimization process, thereby increasing the computational throughput. This algorithm uses a quantum processing unit to probe the needed probability mass functions and a classical processing unit perform the remaining calculations, including the energy minimization. The ansatz form does not restrict the Fock space and provides full control over the trial state, including the implementation of symmetry and other physically motivated constraints.
@article{arxiv.2303.15237,
title = {Cascaded variational quantum eigensolver algorithm},
author = {Daniel Gunlycke and C. Stephen Hellberg and John P. T. Stenger},
journal= {arXiv preprint arXiv:2303.15237},
year = {2024}
}