Trainability Beyond Linearity in Variational Quantum Objectives
Gordon Ma, Xiufan Li

TL;DR
This paper characterizes when variational quantum objectives avoid exponential gradient suppression, revealing a structural boundary based on the affine nature of the loss and proposing a new design perspective.
Contribution
It provides a precise structural criterion for the trainability of quantum objectives and introduces a new framework for understanding gradient behavior beyond affine losses.
Findings
Affine objectives admit a fixed-observable representation, avoiding exponential suppression.
Non-affine losses can potentially counteract gradient suppression through amplification.
Numerical results show amplification-capable objectives achieve significantly larger gradients than affine ones.
Abstract
Barren-plateau results have established exponential gradient suppression as a widely cited obstacle to the scalability of variational quantum algorithms. When and whether these results extend to a given objective has been addressed through loss-specific arguments, but a general structural characterization has remained open. We show that the objective itself admits a fixed-observable representation if and only if the loss is affine in the measured statistics, thereby identifying the exact boundary of the standard concentration-based proof template. Existing transfer results for non-affine losses achieve this reduction under additional assumptions; our characterization implies that such a reduction is not structurally available for a class of non-affine objectives, placing them outside the automatic reach of the existing proof template. Beyond the affine regime, a chain-rule decomposition…
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.
