Stochastic optimization algorithms for quantum applications

TL;DR

This paper reviews and introduces stochastic optimization algorithms for quantum applications, highlighting the superior performance of complex number-based methods in variational quantum algorithms and quantum state tasks.

Contribution

It proposes new stochastic algorithms in the complex number field and evaluates their performance, demonstrating advantages over real-number methods in quantum optimization tasks.

Findings

Complex number optimization algorithms outperform real-number methods.

First-order complex algorithms achieve the best performance.

Complex quantum natural algorithms require less hyperparameter tuning.

Abstract

Hybrid classical quantum optimization methods have become an important tool for efficiently solving problems in the current generation of NISQ computers. These methods use an optimization algorithm executed in a classical computer, fed with values of the objective function obtained in a quantum processor. A proper choice of optimization algorithm is essential to achieve good performance. Here, we review the use of first-order, second-order, and quantum natural gradient stochastic optimization methods, which are defined in the field of real numbers, and propose new stochastic algorithms defined in the field of complex numbers. The performance of all methods is evaluated by means of their application to variational quantum eigensolver, quantum control of quantum states, and quantum state estimation. In general, complex number optimization algorithms perform best, with first-order complex algorithms consistently achieving the best performance, closely followed by complex quantum natural algorithms, which do not require expensive hyperparameters calibration. In particular, the scalar formulation of the complex quantum natural algorithm allows to achieve good performance with low classical computational cost.