Adaptive Observation Cost Control for Variational Quantum Eigensolvers
Christopher J. Anders, Kim Andrea Nicoli, Bingting Wu, Naima Elosegui, Samuele Pedrielli, Lena Funcke, Karl Jansen, Stefan Kühn
Abstract
The objective to be minimized in the variational quantum eigensolver (VQE) has a restricted form, which allows a specialized sequential minimal optimization (SMO) that requires only a few observations in each iteration. However, the SMO iteration is still costly due to the observation noise---one *observation* at a point typically requires averaging over hundreds to thousands of repeated quantum *measurement shots* for achieving a reasonable noise level. In this paper, we propose an adaptive cost control method, named *subspace in confident region* (SubsCoRe), for SMO. SubsCoRe uses the Gaussian process (GP) surrogate, and requires it to have low uncertainty over the subspace being updated, so that optimization in each iteration is performed with guaranteed accuracy. Adaptive cost control is performed by setting the required accuracy according to the progress of the optimization, and identifying the minimum number of measurement shots, as well as their distribution, satisfying the SubsCoRe requirement.
BibTeX
@inproceedings{
anders2024adaptive,
title={Adaptive Observation Cost Control for Variational Quantum Eigensolvers},
author={Christopher J. Anders and Kim Andrea Nicoli and Bingting Wu and Naima Elosegui and Samuele Pedrielli and Lena Funcke and Karl Jansen and Stefan K{\"u}hn and Shinichi Nakajima},
booktitle={Forty-first International Conference on Machine Learning},
year={2024},
url={https://openreview.net/forum?id=dSrdnhLS2h}
}