Back to News
quantum-computing

Trainability Beyond Linearity in Variational Quantum Objectives

arXiv Quantum Physics
Loading...
4 min read
0 likes
Trainability Beyond Linearity in Variational Quantum Objectives

Summarize this article with:

Quantum Physics arXiv:2604.18846 (quant-ph) [Submitted on 20 Apr 2026] Title:Trainability Beyond Linearity in Variational Quantum Objectives Authors:Gordon Ma, Xiufan Li View a PDF of the paper titled Trainability Beyond Linearity in Variational Quantum Objectives, by Gordon Ma and Xiufan Li View PDF HTML (experimental) 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 reveals three governing factors -- model responsivity, loss-side signal, and transmittance -- and induces a loss-class dichotomy: bounded-gradient losses inherit suppression, while amplification-capable losses can in principle counteract it. In the exponentially wide setting, both classes fail, but for different structural reasons. When the interface is instead designed at polynomial width -- exposing coarse-grained statistics rather than individual bitstring probabilities -- the exponential-dimensional obstruction is relaxed and the dichotomy plays a genuine role. In a numerical demonstration on a charge-conserving quantum system, the amplification-capable objective produces resolved gradients several orders of magnitude larger than affine and inheriting baselines at comparable shot budgets. Over the tested interval, its scaling trend is statistically distinguished from the exponential trend of both alternatives. The boundary is affine; what lies beyond it is a representation-design problem. Comments: Subjects: Quantum Physics (quant-ph); Machine Learning (cs.LG) Cite as: arXiv:2604.18846 [quant-ph] (or arXiv:2604.18846v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2604.18846 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Gordon Yuan Ning Ma [view email] [v1] Mon, 20 Apr 2026 21:12:10 UTC (253 KB) Full-text links: Access Paper: View a PDF of the paper titled Trainability Beyond Linearity in Variational Quantum Objectives, by Gordon Ma and Xiufan LiView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-04 Change to browse by: cs cs.LG References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-machine-learning
government-funding
quantum-algorithms

Source Information

Source: arXiv Quantum Physics