Efficient classical calculation of the Quantum Natural Gradient
arXiv:2011.02991
Abstract
Quantum natural gradient has emerged as a superior minimisation technique in quantum variational algorithms. Classically simulating the algorithm running on near-future quantum hardware is paramount in its study, as it is for all variational algorithms. In this case, state-vector simulation of the P-parameter/gate ansatz circuit does not dominate the runtime; instead, calculation of the Fisher information matrix becomes the bottleneck, involving O(P^3) gate evaluations, though this can be reduced to O(P^2) gates by using O(P) temporary state-vectors. This is similar to the gradient calculation subroutine dominating the simulation of quantum gradient descent, which has attracted HPC strategies and bespoke simulation algorithms with asymptotic speedups. We here present a novel simulation strategy to precisely calculate the quantum natural gradient in O(P^2) gates and O(1) state-vectors. While more complicated, our strategy is in the same spirit as that presented for gradients in Reference 6, and involves iteratively evaluating recurrent forms of the Fisher information matrix. Our strategy uses only "apply gate", "clone state" and "inner product" operations which are present in practically all quantum computing simulators. It is furthermore compatible with parallelisation schemes, like hardware acceleration and distribution. Since our scheme leverages a form of the Fisher information matrix for strictly unitary ansatz circuits, it cannot be simply extended to density matrix simulation of quantum natural gradient with non-unitary circuits.
arXiv comment11 pages, 1 figure, 1 table, 8 algorithms
References in corpus (16)
- Quantum Computing in the NISQ era and beyond
- A variational eigenvalue solver on a quantum processor
- The theory of variational hybrid quantum-classical algorithms
- Quantum computational chemistry
- Evaluating analytic gradients on quantum hardware
- Variational ansatz-based quantum simulation of imaginary time evolution
- Quantum Natural Gradient
- ProjectQ: An Open Source Software Framework for Quantum Computing
- Hybrid Quantum-Classical Approach to Quantum Optimal Control
- Open source software in quantum computing
- Methodology for replacing indirect measurements with direct measurements
- qHiPSTER: The Quantum High Performance Software Testing Environment
- Measurement cost of metric-aware variational quantum algorithms
- Quantum++: A modern C++ quantum computing library
- On the natural gradient for variational quantum eigensolver
- Efficient calculation of gradients in classical simulations of variational quantum algorithms