Single-component gradient rules for variational quantum algorithms
Thomas Hubregtsen, Frederik Wilde, Shozab Qasim, Jens Eisert

TL;DR
This paper unifies and generalizes gradient evaluation methods for variational quantum algorithms, introducing a new parameter shift rule that encompasses existing methods and offers insights into their limitations and potential extensions.
Contribution
It presents a generalized parameter shift rule for quantum gradient estimation, unifying existing methods and analyzing their fundamental constraints.
Findings
Unified family of gradient rules for variational quantum algorithms.
Proved the non-existence of a single-evaluation parameter shift rule.
Introduced a new perspective for developing future gradient rules.
Abstract
Many near-term quantum computing algorithms are conceived as variational quantum algorithms, in which parameterized quantum circuits are optimized in a hybrid quantum-classical setup. Examples are variational quantum eigensolvers, quantum approximate optimization algorithms as well as various algorithms in the context of quantum-assisted machine learning. A common bottleneck of any such algorithm is constituted by the optimization of the variational parameters. A popular set of optimization methods work on the estimate of the gradient, obtained by means of circuit evaluations. We will refer to the way in which one can combine these circuit evaluations as gradient rules. This work provides a comprehensive picture of the family of gradient rules that vary parameters of quantum gates individually. The most prominent known members of this family are the parameter shift rule and the finite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
