Estimation of Quantum Fisher Information via Stein's Identity in Variational Quantum Algorithms
arXiv:2502.17231 · doi:10.22331/q-2025-07-21-1798
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.
References in corpus (12)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Fisher information matrix and multiparameter estimation
- Variational ansatz-based quantum simulation of imaginary time evolution
- Quantum Natural Gradient
- A Geometric Perspective on Quantum Parameter Estimation
- Estimating the gradient and higher-order derivatives on quantum hardware
- Fisher Information in Noisy Intermediate-Scale Quantum Applications
- Quantum Natural Gradient with Geodesic Corrections for Small Shallow Quantum Circuits
- Concurrent VQE for Simulating Excited States of the Schwinger Model