Robustness of Variational Quantum Algorithms against stochastic parameter perturbation
Abstract
Variational quantum algorithms are tailored to perform within the constraints of current quantum devices, yet they are limited by performance-degrading errors. In this study, we consider a noise model that reflects realistic gate errors inherent to variational quantum algorithms. We investigate the decoherence of a variationally prepared quantum state due to this noise model, which causes a deviation from the energy estimation in the variational approach. By performing a perturbative analysis of optimized circuits, we determine the noise threshold at which the criteria set by the stability lemma is met. We assess our findings against the variational quantum eigensolver and quantum approximate optimization algorithm for various problems with up to 14 qubits. Moreover, we show that certain gate errors have a significantly smaller impact on the coherence of the state, allowing us to reduce the execution time without compromising performance.
Cite
@article{arxiv.2301.00048,
title = {Robustness of Variational Quantum Algorithms against stochastic parameter perturbation},
author = {Daniil Rabinovich and Ernesto Campos and Soumik Adhikary and Ekaterina Pankovets and Dmitry Vinichenko and Jacob Biamonte},
journal= {arXiv preprint arXiv:2301.00048},
year = {2024}
}
Comments
11 pages, 8 figures, published version