Variational quantum algorithms (VQAs) are among the most promising algorithms in the era of noisy intermediate scale quantum devices. Such algorithms are constructed using a parametrization $U(\theta$) with a classical optimizer that updates the parameters $\theta$ in order to minimize a cost function $C$. For this task, in general the gradient descent method, or one of its variants, is used. This is a method where the circuit parameters are updated iteratively using the cost function gradient. However, several works in the literature have shown that this method suffers from a phenomenon known as the barren plateaus (BPs). In this paper, we propose a method to mitigate BPs. In general, the parameters $\theta$ used in the parametrization $U$ are randomly generated. In our method they are obtained from a classical neural network (CNN). We show that this method, besides to being able to mitigate BPs during startup, is also able to mitigate the effect of BPs during the VQA training. In addition, we also show how this method behaves for different CNN architectures.

• Received 27 May 2022
• Revised 2 August 2022
• Accepted 11 October 2022

DOI:https://doi.org/10.1103/PhysRevA.106.042433