Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.29350

Quantum Natural Gradient on Quotient Spaces

Zeyu Chen

quant-phmath-phSubmitted Aug 29, 2026• Announced Sep 1, 2026• 3 citations• Revised Sep 10, 2026 (v2)
v1 · Aug 29, 2026v2 · Sep 10, 2026
arXivHTMLPDF

Abstract

A parametrized quantum circuit reports its state geometry through a quantum Fisher information matrix (QFIM), often singular. A small Fisher value can reflect exact state-preserving redundancy, compression by the circuit chart, or weak intrinsic distinguishability, and these mechanisms call for different numerical treatments. We show that the circuit metric factors as $F=B^{*}MB$, where $B$ is the state-level circuit-to-orbit differential and $M$ is the intrinsic Fisher operator on the reachable orbit. The factorization identifies the exact kernel as $\ker B$, separates coordinate transfer from intrinsic geometry, and yields the condition for a circuit to realize an orbit-level quantum natural-gradient (QNG) direction. When the prescribed redundancy exhausts the Fisher kernel, the Moore--Penrose update is the minimum-norm horizontal lift of the quotient Riemannian gradient. At critical points with a locally diffeomorphic quotient-to-orbit map, chart singular values cancel from the linearized QNG operator while intrinsic anisotropy remains; in the trace-orthonormal full-control generator frame, excitation-gap anisotropy gives $κ_{\mathrm{QNG}}=κ_{\mathrm{Eucl}}$. Representation theory makes $M$ explicit on highest-weight, Slater, and fermionic-Gaussian orbits, and cominuscule fidelity flow becomes integrable, with conserved principal-defect ratios, cubic Lie-retracted convergence at $η=2$, and stability boundary $η=4$. Finite data impose a second boundary: an estimated QFIM and its confidence radius alone cannot distinguish an exact zero from a small physical mode, so the estimated spectrum alone cannot license hard projection. Under depolarization, inverse-Fisher scaling amplifies mean updates and fluctuations together and cannot restore update signal-to-noise. A redundant Slater/Givens circuit confirms exact transfer identities and illustrates finite-shot tradeoffs.

Related papers

Quantum Natural Gradient Optimization for Convergence Reliability in NISQ Variational Quantum Algorithms

Mezbah Uddin Rafi

Abstract Variational Quantum Algorithms (VQAs) are widely regarded as the most promising route to practical quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) hardware, but their trainability is threatened by the barren plateau phenomenon, in which cost-function gradients vanish exponentially with system size and circuit depth. Standard first-order optimizers, which treat the parameter space of a parameterized quantum circuit (PQC) as flat Euclidean space, are especially vulnerable to this effect and to the additional gradient suppression introduced by hardware noise. This extended treatment presents (i) a from-first-principles derivation of Quantum Natural Gradient (QNG) descent, tracing its lineage from Amari's classical information geometry [1] through the Fubini-Study metric to the Quantum Fisher Information Matrix (QFIM); (ii) a complete taxonomy of barren-plateau mechanisms (expressibility-induced, entanglement-induced, cost-function-locality-induced, and noise-induced); (iii) a comparative survey of the broader NISQ optimizer landscape (SPSA, Adam, COBYLA, Rotosolve, Quantum Natural SPSA, and reduced-cost QFIM estimators); and (iv) a controlled simulation study comparing QNG against vanilla gradient descent on a 4-qubit weighted MaxCut problem under three physically motivated NISQ noise models. Across 50 independent trials, QNG raised the convergence success rate from 30% to 95%, reduced the mean iteration count to convergence by a factor of roughly 6, and achieved a 16% net wall-clock speedup despite the added per-iteration cost of QFIM estimation. We give the full theoretical basis for these gains, an exhaustive discussion of their limitations, an A-to-Z glossary of the field's terminology, and a staged roadmap toward physical hardware validation. Figure placements throughout the document are annotated with detailed image-generation prompts so that the accompanying visual assets can be produced independently of this text.

•Jul 28, 2026•0 citations

Quantum Natural Muon: Spectral-Natural Optimization for Variational Quantum Circuits

Duong Do, Duong Tung Nguyen

Training parameterized quantum circuits requires optimization methods that account for two distinct structures: the information geometry of quantum states and the matrix or tensor structure induced by circuit parameterization. We introduce Quantum Natural Muon (QNM), a spectral natural-gradient framework that applies polar normalization to circuit-semantic parameter blocks after damped quantum Fisher preconditioning. This ordering is essential: quantum Fisher preconditioning and blockwise polar normalization do not commute in general, so QNM is not an order-free composition of quantum natural gradient (QNG) and Muon. We show that Frobenius-matched polar mixing preserves active singular subspaces while raising a spectral floor and improving active conditioning, and that the resulting direction remains a controlled perturbation of QNG. For its distance-aware realization (DA-QNM), we further establish alignment, descent, and nonconvex stationarity guarantees for the normalized update, together with perturbation bounds under gradient and QFIM estimation error. Experiments on variational quantum eigensolving, weighted QAOA-MaxCut, and supervised quantum classification isolate the roles of quantum geometry, circuit-semantic spectral structure, and radius control. The strongest gains arise when the spectral blocks match the circuit structure, supporting the central principle that quantum-state and structured spectral geometries provide complementary information for variational quantum optimization.

arXiv:2611.10105•Nov 6, 2026•0 citations

Loss-aware state space geometry for quantum variational algorithms

Ankit Gill, Kunal Pal

The natural gradient descent optimisation technique is an efficient optimising protocol for broad classes of classical and quantum systems that takes the underlying geometry of the parameter manifold into account by means of using either the Fisher information metric of the classical probability distribution function or the Fubini-Study tensor of the associated parametrised quantum states in the consequent update rules. Even though the natural gradient descent procedure utilises the geometry of the space of probability or states, it is, however, insensitive to the measure of parametrised distance on the space of possible outcomes when the corresponding optimising problem is considered for the expectation value of a classical or quantum observable with respect to the probability distribution or the quantum state. In this work, we introduce a generic optimising principle, where the intrinsic geometry of the space of outcomes has been taken into account suitably, either by using an ambient space construction with a base statistical manifold with the usual Fisher information metric (or the Fubini-Study tensor), where the loss hypersurface is embedded to, or by means of a first-principle construction from the overlap of nearby quantum states on the projective Hilbert space. This construction as well as a family of conformal variants yields a form of loss-aware natural gradient updates that rescale the effective step size while preserving the descent direction. We benchmark the resulting optimisers on variational quantum circuit examples and on a classical neural network task, finding that, while the standard natural gradient remains the most robust on average, the proposed conformal schemes can improve best-case convergence in favourable regimes.

quant-pharXiv:2604.05627•Journal of Physics A Mathematical and Theoretical•Apr 8, 2026•0 citations

Information-Geometric Quantum Control: Convergence Limits, Brachistochrone Speed Limits, and Shot-Noise Concentration in Quantum Natural Gradient Optimization

Ahmed Hala

We formalize the exact optimization boundaries, physical time evolution minimums, and finite-resource measurement constraints that govern the performance of the Quantum Natural Gradient (QNG) update rule on parameterized variational manifolds. First, we state and prove Theorem 4.1 to characterize the exact convergence properties of QNG updates under bounded Riemannian metrics. Crucially, we isolate the causal mechanism linking ansatz expressivity to geometric degradation, proving that the pulled-back Fubini–Study metric elements inherit the exponential O(2−N ) variance collapse dictated by Haar measure integration over random unitary circuit layouts. This scaling is shown to drive an exponential inflation of the metric condition number, establishing a clear geometric origin for the numerical tracking instabilities that stall optimization vectors in large-scale parameter spaces. Second, we formalize the Information-Geometric Quantum Brachistochrone (Theorem 4.2), proving that under instantaneous velocity limitations derived from the system’s energy variance, the absolute minimum time T required to map a state vector between two configurations is bounded strictly below by the integrated Riemannian geodesic distance Lgeodesic. This result demonstrates that flat Euclidean metrics severely underestimate physical time requirements near highly entangled boundaries where local manifold curvature dominates. Finally, we derive a sharp Shot-Noise Metric Concentration Bound (Theorem 4.3), resolving an exact cyclic trace simplification to prove that finite-shot perturbation errors concentrate according to a structural noise alignment factor κ(θ) = Tr(Σg−1)/∥∆θ∥2g . Multi-trial multinomial simulations validate this relation across all shot budgets (102 to 105), verifying that the empirical breach probability tracks safely below the analytical trace constraint line. This bound exposes a fundamental engineering trade-off: as an optimization path approaches ill conditioned regions where the minimum eigenvalue collapses (λmin → 0), the tracking framework requires a quadratic expansion of measurement resources to suppress shot noise and stabilize control loops.

•Jun 30, 2026•0 citations

Information Geometry and the Variational Structure of Physical Dynamics: A Rigorous Foundation

Anthony L Perry

By Chentsov’s theorem, the Fisher–Rao metric is, up to a constant factor, the only Riemannian metric on finite probability simplices that is invariant under sufficient st atistics. We ask which dynamical laws in physics, population biology and machine learning can be written in terms of this one metric, and in what way. Two classes appear. Gradient flows of the Fisher metric include the replicator equation, which is an exact Shahshahani gradient flow of mean fitness, and natural-gradient learning; both have variational characterisations as steepest descent or as Kullback–Leibler proximal steps. Hamiltonian flows arise on Kähler statistical manifolds, where the Fisher metric and a symplectic form are the real and imaginary parts of the quantum geometric tensor. This class contains the Schrödinger equation on projective Hilbert space and, through the time-dependent variational principle on Gaussian coherent states, Hamilton’s equations for a smoothed Hamiltonian, for which we give an explicit O(h¯ ) bound on the classical limit. In both classes the metric sets the speed of evolution. A single Cauchy–Schwarz inequality then contains Fisher’s fundamental theorem, a bound on the rate of change of a trait mean, and the Mandelstam–Tamm bound as special cases. We also show that the initial purity loss of a pure state under Lindblad dephasing equals one half of the quantum Fisher information of the coupling operator, and that the Fisher metric of a Gibbs family inherits the critical exponent of the susceptibility. Every quantitative statement is checked numerically in an open test suite. An exact-Fisher study of small neural networks gives an effective-dimension scaling exponent of 0.27 (95% confidence interval 0.17–0.36).

•Dec 30, 2025•0 citations

Random Natural Gradient

Ioannis Kolotouros, Petros Wallden

Hybrid quantum-classical algorithms appear to be the most promising approach for near-term quantum applications. An important bottleneck is the classical optimization loop, where the multiple local minima and the emergence of barren plateaux make these approaches less appealing. To improve the optimization the Quantum Natural Gradient (QNG) method \cite{stokes2020quantum} was introduced – a method that uses information about the local geometry of the quantum state-space. While the QNG-based optimization is promising, in each step it requires more quantum resources, since to compute the QNG one requires O(m2) quantum state preparations, where m is the number of parameters in the parameterized circuit. In this work we propose two methods that reduce the resources/state preparations required for QNG, while keeping the advantages and performance of the QNG-based optimization. Specifically, we first introduce the Random Natural Gradient (RNG) that uses random measurements and the classical Fisher information matrix (as opposed to the quantum Fisher information used in QNG). The essential quantum resources reduce to linear O(m) and thus offer a quadratic "speed-up", while in our numerical simulations it matches QNG in terms of accuracy. We give some theoretical arguments for RNG and then benchmark the method with the QNG on both classical and quantum problems. Secondly, inspired by stochastic-coordinate methods, we propose a novel approximation to the QNG which we call Stochastic-Coordinate Quantum Natural Gradient that optimizes only a small (randomly sampled) fraction of the total parameters at each iteration. This method also performs equally well in our benchmarks, while it uses fewer resources than the QNG.

arXiv:2311.04135•Quantum•Oct 22, 2024•13 citations
A parametrized quantum circuit reports its state geometry through a quantum Fisher information matrix (QFIM), often singular. A small Fisher value can reflect exact state-preserving redundancy, compression by the circuit chart, or weak intrinsic distinguishability, and these mechanisms call for different numerical treatments. We show that the circuit metric factors as F=B∗MBF=B^{*}MBF=B∗MB, where BBB is the state-level circuit-to-orbit differential and MMM is the intrinsic Fisher operator on the reachable orbit. The factorization identifies the exact kernel as ker⁡B\ker BkerB, separates coordinate transfer from intrinsic geometry, and yields the condition for a circuit to realize an orbit-level quantum natural-gradient (QNG) direction. When the prescribed redundancy exhausts the Fisher kernel, the Moore--Penrose update is the minimum-norm horizontal lift of the quotient Riemannian gradient. At critical points with a locally diffeomorphic quotient-to-orbit map, chart singular values cancel from the linearized QNG operator while intrinsic anisotropy remains; in the trace-orthonormal full-control generator frame, excitation-gap anisotropy gives κQNG=κEuclκ_{\mathrm{QNG}}=κ_{\mathrm{Eucl}}κQNG​=κEucl​. Representation theory makes MMM explicit on highest-weight, Slater, and fermionic-Gaussian orbits, and cominuscule fidelity flow becomes integrable, with conserved principal-defect ratios, cubic Lie-retracted convergence at η=2η=2η=2, and stability boundary η=4η=4η=4. Finite data impose a second boundary: an estimated QFIM and its confidence radius alone cannot distinguish an exact zero from a small physical mode, so the estimated spectrum alone cannot license hard projection. Under depolarization, inverse-Fisher scaling amplifies mean updates and fluctuations together and cannot restore update signal-to-noise. A redundant Slater/Givens circuit confirms exact transfer identities and illustrates finite-shot tradeoffs.
Abstract Variational Quantum Algorithms (VQAs) are widely regarded as the most promising route to practical quantum advantage on Noisy Intermediate-Scale Quantum (NISQ) hardware, but their trainability is threatened by the barren plateau phenomenon, in which cost-function gradients vanish exponentially with system size and circuit depth. Standard first-order optimizers, which treat the parameter space of a parameterized quantum circuit (PQC) as flat Euclidean space, are especially vulnerable to this effect and to the additional gradient suppression introduced by hardware noise. This extended treatment presents (i) a from-first-principles derivation of Quantum Natural Gradient (QNG) descent, tracing its lineage from Amari's classical information geometry [1] through the Fubini-Study metric to the Quantum Fisher Information Matrix (QFIM); (ii) a complete taxonomy of barren-plateau mechanisms (expressibility-induced, entanglement-induced, cost-function-locality-induced, and noise-induced); (iii) a comparative survey of the broader NISQ optimizer landscape (SPSA, Adam, COBYLA, Rotosolve, Quantum Natural SPSA, and reduced-cost QFIM estimators); and (iv) a controlled simulation study comparing QNG against vanilla gradient descent on a 4-qubit weighted MaxCut problem under three physically motivated NISQ noise models. Across 50 independent trials, QNG raised the convergence success rate from 30% to 95%, reduced the mean iteration count to convergence by a factor of roughly 6, and achieved a 16% net wall-clock speedup despite the added per-iteration cost of QFIM estimation. We give the full theoretical basis for these gains, an exhaustive discussion of their limitations, an A-to-Z glossary of the field's terminology, and a staged roadmap toward physical hardware validation. Figure placements throughout the document are annotated with detailed image-generation prompts so that the accompanying visual assets can be produced independently of this text.
Training parameterized quantum circuits requires optimization methods that account for two distinct structures: the information geometry of quantum states and the matrix or tensor structure induced by circuit parameterization. We introduce Quantum Natural Muon (QNM), a spectral natural-gradient framework that applies polar normalization to circuit-semantic parameter blocks after damped quantum Fisher preconditioning. This ordering is essential: quantum Fisher preconditioning and blockwise polar normalization do not commute in general, so QNM is not an order-free composition of quantum natural gradient (QNG) and Muon. We show that Frobenius-matched polar mixing preserves active singular subspaces while raising a spectral floor and improving active conditioning, and that the resulting direction remains a controlled perturbation of QNG. For its distance-aware realization (DA-QNM), we further establish alignment, descent, and nonconvex stationarity guarantees for the normalized update, together with perturbation bounds under gradient and QFIM estimation error. Experiments on variational quantum eigensolving, weighted QAOA-MaxCut, and supervised quantum classification isolate the roles of quantum geometry, circuit-semantic spectral structure, and radius control. The strongest gains arise when the spectral blocks match the circuit structure, supporting the central principle that quantum-state and structured spectral geometries provide complementary information for variational quantum optimization.
The natural gradient descent optimisation technique is an efficient optimising protocol for broad classes of classical and quantum systems that takes the underlying geometry of the parameter manifold into account by means of using either the Fisher information metric of the classical probability distribution function or the Fubini-Study tensor of the associated parametrised quantum states in the consequent update rules. Even though the natural gradient descent procedure utilises the geometry of the space of probability or states, it is, however, insensitive to the measure of parametrised distance on the space of possible outcomes when the corresponding optimising problem is considered for the expectation value of a classical or quantum observable with respect to the probability distribution or the quantum state. In this work, we introduce a generic optimising principle, where the intrinsic geometry of the space of outcomes has been taken into account suitably, either by using an ambient space construction with a base statistical manifold with the usual Fisher information metric (or the Fubini-Study tensor), where the loss hypersurface is embedded to, or by means of a first-principle construction from the overlap of nearby quantum states on the projective Hilbert space. This construction as well as a family of conformal variants yields a form of loss-aware natural gradient updates that rescale the effective step size while preserving the descent direction. We benchmark the resulting optimisers on variational quantum circuit examples and on a classical neural network task, finding that, while the standard natural gradient remains the most robust on average, the proposed conformal schemes can improve best-case convergence in favourable regimes.
We formalize the exact optimization boundaries, physical time evolution minimums, and finite-resource measurement constraints that govern the performance of the Quantum Natural Gradient (QNG) update rule on parameterized variational manifolds. First, we state and prove Theorem 4.1 to characterize the exact convergence properties of QNG updates under bounded Riemannian metrics. Crucially, we isolate the causal mechanism linking ansatz expressivity to geometric degradation, proving that the pulled-back Fubini–Study metric elements inherit the exponential O(2−N ) variance collapse dictated by Haar measure integration over random unitary circuit layouts. This scaling is shown to drive an exponential inflation of the metric condition number, establishing a clear geometric origin for the numerical tracking instabilities that stall optimization vectors in large-scale parameter spaces. Second, we formalize the Information-Geometric Quantum Brachistochrone (Theorem 4.2), proving that under instantaneous velocity limitations derived from the system’s energy variance, the absolute minimum time T required to map a state vector between two configurations is bounded strictly below by the integrated Riemannian geodesic distance Lgeodesic. This result demonstrates that flat Euclidean metrics severely underestimate physical time requirements near highly entangled boundaries where local manifold curvature dominates. Finally, we derive a sharp Shot-Noise Metric Concentration Bound (Theorem 4.3), resolving an exact cyclic trace simplification to prove that finite-shot perturbation errors concentrate according to a structural noise alignment factor κ(θ) = Tr(Σg−1)/∥∆θ∥2g . Multi-trial multinomial simulations validate this relation across all shot budgets (102 to 105), verifying that the empirical breach probability tracks safely below the analytical trace constraint line. This bound exposes a fundamental engineering trade-off: as an optimization path approaches ill conditioned regions where the minimum eigenvalue collapses (λmin → 0), the tracking framework requires a quadratic expansion of measurement resources to suppress shot noise and stabilize control loops.
By Chentsov’s theorem, the Fisher–Rao metric is, up to a constant factor, the only Riemannian metric on finite probability simplices that is invariant under sufficient st atistics. We ask which dynamical laws in physics, population biology and machine learning can be written in terms of this one metric, and in what way. Two classes appear. Gradient flows of the Fisher metric include the replicator equation, which is an exact Shahshahani gradient flow of mean fitness, and natural-gradient learning; both have variational characterisations as steepest descent or as Kullback–Leibler proximal steps. Hamiltonian flows arise on Kähler statistical manifolds, where the Fisher metric and a symplectic form are the real and imaginary parts of the quantum geometric tensor. This class contains the Schrödinger equation on projective Hilbert space and, through the time-dependent variational principle on Gaussian coherent states, Hamilton’s equations for a smoothed Hamiltonian, for which we give an explicit O(h¯ ) bound on the classical limit. In both classes the metric sets the speed of evolution. A single Cauchy–Schwarz inequality then contains Fisher’s fundamental theorem, a bound on the rate of change of a trait mean, and the Mandelstam–Tamm bound as special cases. We also show that the initial purity loss of a pure state under Lindblad dephasing equals one half of the quantum Fisher information of the coupling operator, and that the Fisher metric of a Gibbs family inherits the critical exponent of the susceptibility. Every quantitative statement is checked numerically in an open test suite. An exact-Fisher study of small neural networks gives an effective-dimension scaling exponent of 0.27 (95% confidence interval 0.17–0.36).
Hybrid quantum-classical algorithms appear to be the most promising approach for near-term quantum applications. An important bottleneck is the classical optimization loop, where the multiple local minima and the emergence of barren plateaux make these approaches less appealing. To improve the optimization the Quantum Natural Gradient (QNG) method \cite{stokes2020quantum} was introduced – a method that uses information about the local geometry of the quantum state-space. While the QNG-based optimization is promising, in each step it requires more quantum resources, since to compute the QNG one requires O(m2) quantum state preparations, where m is the number of parameters in the parameterized circuit. In this work we propose two methods that reduce the resources/state preparations required for QNG, while keeping the advantages and performance of the QNG-based optimization. Specifically, we first introduce the Random Natural Gradient (RNG) that uses random measurements and the classical Fisher information matrix (as opposed to the quantum Fisher information used in QNG). The essential quantum resources reduce to linear O(m) and thus offer a quadratic "speed-up", while in our numerical simulations it matches QNG in terms of accuracy. We give some theoretical arguments for RNG and then benchmark the method with the QNG on both classical and quantum problems. Secondly, inspired by stochastic-coordinate methods, we propose a novel approximation to the QNG which we call Stochastic-Coordinate Quantum Natural Gradient that optimizes only a small (randomly sampled) fraction of the total parameters at each iteration. This method also performs equally well in our benchmarks, while it uses fewer resources than the QNG.