Quantum Tilted Loss in Variational Optimization: Theory and Applications
Yixian Qiu, Josep Lumbreras, Xiufan Li, Patrick Rebentrost

TL;DR
This paper introduces the Quantum Tilted Loss (QTL), a novel operator-level approach that reshapes the optimization landscape in variational quantum algorithms to improve trainability, balancing landscape sharpness and measurement cost.
Contribution
The authors propose QTL, a generalization of classical exponential tilting, unifying various heuristics and providing a theoretical framework for enhancing VQA trainability.
Findings
QTL can amplify gradient signals in structured settings.
A trade-off exists between landscape sharpness and measurement cost.
Ascending tilt schedules outperform fixed tilts in finite-shot simulations.
Abstract
Variational quantum algorithms (VQAs) are leading strategies for using near-term quantum devices, with a well-studied bottleneck being their trainability. Standard expectation-value objectives with expressive circuits frequently encounter barren plateaus in the optimization landscape during training. To address this challenge, we introduce the Quantum Tilted Loss (QTL), an operator-level generalization of classical exponential tilting designed to systematically reshape the optimization landscape. By tuning a single continuous parameter, QTL can amplify gradient signals in structured settings while preserving the problem's true global minima. We provide a theoretical foundation that unifies standard expectation minimization with popular tunable heuristics, such as Conditional Value-at-Risk (CVaR) and Gibbs formulations. Deploying this framework requires balancing the geometric benefits…
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.
