What a Reporting Convention Hides: A Matched-Budget Audit of Quantum Natural Gradient with an Exactly Computed Metric
cs.LG, quant-ph
Submitted: 2026-10-07
Updated: 2026-10-07
Comments: 29 pages, 6 figures, 12 tables. Lu Wei and Yufeng Wang contributed equally
License: http://creativecommons.org/licenses/by/4.0/
The gist: Several published comparisons of variational quantum optimizers time only runs that reach a target loss, or read the verdict at a single target.
Abstract
Several published comparisons of variational quantum optimizers time only runs that reach a target loss, or read the verdict at a single target. Either convention could decide whether an optimizer's costlier steps pay off. We measure how much each convention changes verdicts among Adam, simultaneous perturbation stochastic approximation (SPSA) and quantum natural gradient (QNG), on initializations held out from the selection of settings. We compute the exact metric that preconditions QNG, price every step in circuit evaluations and give every method the same budget. In a median pooled over circuit widths, cost families and a sweep of settings with common misses, SPSA needs more than twice Adam's evaluations to reach a loose target. Dropping the censored runs that miss the target hides this gap. On the global-cost family we hold fixed the settings selected for a strict target. QNG then usually reaches the loose target after Adam but the strict target first. QNG's strict-target lead disappears when the metric's simulator price, linear in the number of parameters, is replaced by an assumed hardware count quadratic in that number. We recommend charging every miss the budget and reporting verdicts across targets.
Sources
- Benchmarking in Optimization: Best Practice and Open Issues
- Better than classical? The subtle art of benchmarking quantum machine learning models
- On Empirical Comparisons of Optimizers for Deep Learning
- Benchmarking Neural Network Training Algorithms
- COCO: Performance Assessment
- Optimal training of variational quantum algorithms without barren plateaus
- Benchmarking a quantum annealing processor with the time-to-target metric
- Preconditioning Natural and Second Order Gradient Descent in Quantum Optimization: A Performance Benchmark
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks