Improving Variational Quantum Circuit Optimization via Hybrid Algorithms and Random Axis Initialization

Abstract

Variational quantum circuits (VQCs) are an essential tool in applying noisy intermediate-scale quantum computers to practical problems. VQCs are used as a central component in many algorithms, for example, in quantum machine learning, optimization, and quantum chemistry. Several methods have been developed to optimize VQCs. In this work, we enhance the performance of the well-known Rotosolve method, a gradient-free optimization algorithm specifically designed for VQCs. We develop two hybrid algorithms that combine an improved version of Rotosolve with the free quaternion selection (FQS) algorithm, which is the main focus of this study. Through numerical simulations, we observe that these hybrid algorithms achieve higher accuracy and better average performance across different ansatz circuit sizes and cost functions. For shallow variational circuits, we identify a trade-off between the expressivity of the variational ansatz and the speed of convergence to the optimum: a more expressive ansatz ultimately reaches a closer approximation to the true minimum, but at the cost of requiring more circuit evaluations for convergence. By combining the less expressive but fast-converging Rotosolve with the more expressive FQS, we construct hybrid algorithms that benefit from the rapid initial convergence of Rotosolve while leveraging the superior expressivity of FQS. As a result, these hybrid approaches outperform either method used independently.