Quantum Brain
← Back to papers

Quantum Fisher information matrix via its classical counterpart from random measurements

Jianfeng Lu, Kecen Sha·September 10, 2025
Quantum PhysicsMathematical Physicsmath.OC

AI Breakdown

Get a structured breakdown of this paper — what it's about, the core idea, and key takeaways for the field.

Abstract

Preconditioning with the quantum Fisher information matrix (QFIM) is a popular approach in quantum variational algorithms. Yet the QFIM is costly to obtain directly, usually requiring more state preparation than its classical counterpart: the classical Fisher information matrix (CFIM). It is known that averaging the classical Fisher information matrix over Haar-random measurement bases yields $\mathbb{E}_{U\simμ_H}[F^U(\boldsymbolθ)] = \frac{1}{2}Q(\boldsymbolθ)$ for pure states in $\mathbb{C}^N$. In this paper, we review this identity by revealing its connection to covariant measurement in quantum metrology. Furthermore, we go beyond this and obtain the exact variance of CFIM ($O(N^{-1})$), estimate its moment, and establish non-asymptotic concentration bounds ($\exp(-Θ(N)t^2)$), demonstrating that using few random measurement bases is sufficient to approximate the QFIM accurately in high-dimensional settings. This work establishes a solid theoretical foundation for efficient quantum natural gradient methods via randomized measurements.

Related Research

Quantum Intelligence

Ask about quantum research, companies, or market developments.