Parametrized quantum circuits often contain state-preserving redundancies that make the quantum Fisher information matrix (QFIM) singular even when the physical state manifold is regular. We formulate quantum natural gradient (QNG) on the resulting parameter quotient and prove that, when the prescribed redundancy exhausts the Fisher kernel, the Moore--Penrose update is the minimum-norm horizontal lift of the quotient Riemannian gradient. A circuit-to-orbit transfer principle separates intrinsic state distinguishability from circuit-coordinate distortion and gives the exact condition under which a circuit realizes an intrinsic orbit-QNG direction. Representation theory then yields root-resolved Fisher scales on highest-weight flag orbits and isotropic intrinsic metrics for Slater and fermionic-Gaussian manifolds. On cominuscule embeddings, intrinsic fidelity QNG conserves principal-defect ratios and reduces to one scalar equation; Lie-retracted steps are locally cubic at $η=2$, with stability boundary $η=4$. For finite-shot implementations, we separate exact gauge removal from regularization of physical soft modes, obtain zero cumulative gauge drift under structural projection, and derive confidence-controlled soft-mode rules. Under depolarization, inverse-Fisher scaling restores deterministic scale only by amplifying fluctuations and therefore cannot recover a lost update signal-to-noise ratio. A redundant Slater/Givens circuit verifies the transfer law and the predicted finite-shot tradeoffs.
Parametrized quantum circuits often contain state-preserving redundancies that make the quantum Fisher information matrix (QFIM) singular even when the physical state manifold is regular. We formulate quantum natural gradient (QNG) on the resulting parameter quotient and prove that, when the prescribed redundancy exhausts the Fisher kernel, the Moore--Penrose update is the minimum-norm horizontal lift of the quotient Riemannian gradient. A circuit-to-orbit transfer principle separates intrinsic state distinguishability from circuit-coordinate distortion and gives the exact condition under which a circuit realizes an intrinsic orbit-QNG direction. Representation theory then yields root-resolved Fisher scales on highest-weight flag orbits and isotropic intrinsic metrics for Slater and fermionic-Gaussian manifolds. On cominuscule embeddings, intrinsic fidelity QNG conserves principal-defect ratios and reduces to one scalar equation; Lie-retracted steps are locally cubic at η=2, with stability boundary η=4. For finite-shot implementations, we separate exact gauge removal from regularization of physical soft modes, obtain zero cumulative gauge drift under structural projection, and derive confidence-controlled soft-mode rules. Under depolarization, inverse-Fisher scaling restores deterministic scale only by amplifying fluctuations and therefore cannot recover a lost update signal-to-noise ratio. A redundant Slater/Givens circuit verifies the transfer law and the predicted 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.
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.
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.
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.
The Quantum Natural Gradient (QNG) method enhances optimization in variational quantum algorithms (VQAs) by incorporating geometric insights from the quantum state space through the Fubini-Study metric. In this work, we extend QNG by introducing higher-order integrators and geodesic corrections using the Riemannian Euler update rule and geodesic equations, deriving an updated rule for the Quantum Natural Gradient with Geodesic Correction (QNGGC). We also develop an efficient method for computing the Christoffel symbols necessary for these corrections, leveraging the parameter-shift rule to enable direct measurement from quantum circuits. Through theoretical analysis and practical examples, we demonstrate that QNGGC significantly improves convergence rates over standard QNG, highlighting the benefits of integrating geodesic corrections into quantum optimization processes. Our approach paves the way for more efficient quantum algorithms, leveraging the advantages of geometric methods.
Fisher information appears in quantum theory in two mathematically distinct settings: as a classical probability functional in variational reconstructions of Schrodinger dynamics and as the quantum Fisher metric of parameterized density operators. Here we examine how far these roles can be connected without identifying the two objects. Starting from a Hamilton-Jacobi ensemble action, we recover the Fisher term that generates the quantum potential and isolate its contribution to the kinetic-energy expectation. We then analyze the quantum Fisher information matrix (QFIM) of bipartite states. For any pure two-qubit state, the optimized magnitude of the off-diagonal QFIM element for normalized local generators equals the concurrence, while a collective phase generator yields FQ = 4 C^2. Extending the optimized pure-state quantity by a convex roof gives an exact identity with Wootters concurrence for arbitrary mixed two-qubit states. This differs from evaluating the QFIM directly on a mixed density operator: for Werner states the raw optimized cross-QFIM is 2 p^2/(1 + p) and remains nonzero inside the separable region. The gap between the raw and convex-roof quantities therefore isolates, for this family, correlation geometry not captured by entanglement. Finally, in a two-path interferometer with a which-way marker, the optimal phase Fisher information available from local output statistics is I_phi^opt = V^2. These results place probability-gradient energy, bipartite correlation geometry, entanglement, and decoherence-induced loss of local phase sensitivity in a common mathematical setting while preserving the distinctions between classical Fisher information, QFIM geometry, Bell nonlocality, and global phase quantization.