TL;DR
This paper systematically benchmarks classical optimization algorithms for variational quantum chemistry, revealing how noise impacts optimizer performance and proposing strategies to improve energy estimation accuracy in noisy quantum environments.
Contribution
It provides a comprehensive comparison of eight classical optimizers under realistic noise conditions and introduces a novel approach using Evolution Strategies to surpass sampling limits.
Findings
Gradient-based methods excel in noiseless conditions.
Population-based optimizers like CMA-ES are more robust under noise.
Finite-shot sampling can violate the variational principle bounds.
Abstract
The prevalence of variational methods in near-term quantum computing makes optimizer choice critical, yet selection is frequently intuition-based. We therefore present a systematic benchmark of eight classical optimization algorithms for variational quantum chemistry using the truncated Variational Hamiltonian Ansatz. Performance is evaluated on H, H, and LiH in both full and active-space representations under noiseless and finite-shot sampling noise. Sampling noise substantially reshapes cost landscapes, induces wandering near minima, and flips optimizer rankings: gradient-based methods perform best in noiseless simulations, whereas population-based optimizers, particularly CMA-ES, show greater robustness under finite-shot noise. Optimizer performance is strongly problem dependent: Hartree-Fock initialization aids small systems, but its advantage diminishes with system size.…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
