Estimation of Quantum Fisher Information via Stein's Identity in Variational Quantum Algorithms

TL;DR

This paper introduces a novel Stein's identity-based method for estimating the Quantum Fisher Information Matrix in variational quantum algorithms, reducing computational complexity and resource requirements compared to existing stochastic methods.

Contribution

It proposes a new estimation framework for QFIM using Stein's identity, achieving constant complexity and lower resource use than SPSA-based methods.

Findings

Demonstrated feasibility on transverse-field Ising model

Achieved reduced quantum resource requirements

Validated effectiveness on lattice Schwinger model

Abstract

The Quantum Fisher Information Matrix (QFIM) plays a crucial role in quantum optimization algorithms such as Variational Quantum Imaginary Time Evolution and Quantum Natural Gradient Descent. However, computing the full QFIM incurs a quadratic computational cost of O(d^2) with respect to the number of parameters d, limiting its scalability for high-dimensional quantum systems. To address this limitation, stochastic methods such as the Simultaneous Perturbation Stochastic Approximation (SPSA) have been employed to reduce computational complexity to a constant (Quantum 5, 567 (2021)). In this work, we propose an alternative estimation framework based on Stein's identity that also achieves constant computational complexity. Furthermore, our method reduces the quantum resources required for QFIM estimation compared to the SPSA approach. We provide numerical examples using the transverse-field Ising model and the lattice Schwinger model to demonstrate the feasibility of applying our method to realistic quantum systems.