Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information

Abstract

The Quantum Fisher Information matrix (QFIM) is a central metric in promising algorithms, such as Quantum Natural Gradient Descent and Variational Quantum Imaginary Time Evolution. Computing the full QFIM for a model with $d$ parameters, however, is computationally expensive and generally requires $\mathcal{O}(d^2)$ function evaluations. To remedy these increasing costs in high-dimensional parameter spaces, we propose using simultaneous perturbation stochastic approximation techniques to approximate the QFIM at a constant cost. We present the resulting algorithm and successfully apply it to prepare Hamiltonian ground states and train Variational Quantum Boltzmann Machines.

References in corpus (33)

• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• A Quantum Approximate Optimization Algorithm
• Simulated Quantum Computation of Molecular Energies
• Quantum many-body systems out of equilibrium
• Quantum fingerprinting
• Evaluating analytic gradients on quantum hardware
• Extending the computational reach of a noisy superconducting quantum processor
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Quantum optimization using variational algorithms on near-term quantum devices
• Variational ansatz-based quantum simulation of imaginary time evolution
• Simulating Lattice Gauge Theories within Quantum Technologies
• Quantum Natural Gradient
• Theory of variational quantum simulation
• Quantum Computing for Finance: State of the Art and Future Prospects
• Quantum Boltzmann Machine
• Quantum Metropolis Sampling
• Learning the quantum algorithm for state overlap
• Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
• Resource-Efficient Quantum Algorithm for Protein Folding
• Statistical correlations between locally randomized measurements: a toolbox for probing entanglement in many-body quantum states
• Estimating the gradient and higher-order derivatives on quantum hardware
• Grover Adaptive Search for Constrained Polynomial Binary Optimization
• A Quantum-Quantum Metropolis Algorithm
• Variational Thermal Quantum Simulation via Thermofield Double States
• Fisher Information in Noisy Intermediate-Scale Quantum Applications
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Variational Quantum Boltzmann Machines
• Quantum Algorithms for Mixed Binary Optimization applied to Transaction Settlement
• A Variational Quantum Algorithm for Preparing Quantum Gibbs States
• A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
• Quantum-Enhanced Simulation-Based Optimization

Cited by in corpus (22)

• The Variational Quantum Eigensolver: a review of methods and best practices
• Theory of overparametrization in quantum neural networks
• Avoiding barren plateaus using classical shadows
• Fisher Information in Noisy Intermediate-Scale Quantum Applications
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Quantum computing of the ${}^6$Li nucleus via ordered unitary coupled clusters
• Matrix Model simulations using Quantum Computing, Deep Learning, and Lattice Monte Carlo
• Graph neural network initialisation of quantum approximate optimisation
• Solving hadron structures using the basis light-front quantization approach on quantum computers
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
• Improved algorithms of quantum imaginary time evolution for ground and excited states of molecular systems
• A Performance Study of Variational Quantum Algorithms for Solving the Poisson Equation on a Quantum Computer
• Error Bounds for Variational Quantum Time Evolution
• Optimal training of variational quantum algorithms without barren plateaus
• Variational quantum algorithm for unconstrained black box binary optimization: Application to feature selection
• Quantum algorithms for grid-based variational time evolution
• Finite-size criticality in fully connected spin models on superconducting quantum hardware
• Natural parameterized quantum circuit
• A blueprint for a Digital-Analog Variational Quantum Eigensolver using Rydberg atom arrays
• Faster variational quantum algorithms with quantum kernel-based surrogate models
• Monitoring variations of refractive index via Hilbert-Schmidt speed and applying this phenomenon to improve quantum metrology
• Computing Graph Edit Distance with Algorithms on Quantum Devices