Quantum optimization with exact geodesic transport
Andr\'e J. Ferreira-Martins, Renato M. S. Farias, Giancarlo Camilo, Thiago O. Maciel, Allan Tosta, Ruge Lin, Abdulla Alhajri, Tobias Haug, Leandro Aolita

TL;DR
This paper presents a novel variational quantum algorithm architecture that leverages exact geodesic paths on the quantum state manifold, significantly reducing training costs and improving convergence for quantum simulations.
Contribution
It introduces an efficient, parameter-optimal circuit ansatz that surpasses quantum natural gradient methods and incorporates conjugate gradients for accelerated convergence.
Findings
Reduces gradient estimation costs by 62.5%.
Achieves over tenfold reduction in optimization steps in benchmarks.
Successfully demonstrates on quantum hardware for molecular simulations.
Abstract
We introduce an architecture for variational quantum algorithms that can be efficiently trained via parameter updates along exact geodesics on the Riemannian state manifold. This features a parameter-optimal circuit ansatz which supersedes known quantum natural gradient methods by removing expensive estimations of the metric tensor and provably reducing gradient estimation costs by . Moreover, the framework also naturally incorporates conjugate gradients as a built-in feature, giving an accelerated descent method with convergence guarantees that we dub exact geodesic transport with conjugate gradients. Numerical benchmarks against state-of-the-art variational methods for ground-state preparation of molecular Hamiltonians or -dimensional spin chains (both with and without particle-number conservation) up to qubits show reductions of over one order of magnitude in the…
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.
