Efficient calculation of gradients in classical simulations of variational quantum algorithms

Abstract

Calculating the energy gradient in parameter space has become an almost ubiquitous subroutine of variational near-term quantum algorithms. "Faithful" classical emulation of this subroutine mimics its quantum evaluation, and scales as O(P^2) gate operations for P variational parameters. This is often the bottleneck for the moderately-sized simulations, and has attracted HPC strategies like "batch-circuit" evaluation. We here present a novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time and using O(1) state-vectors, compatible with "full-state" state-vector simulators. The prescribed algorithm resembles the optimised technique for automatic differentiation of reversible cost functions, often used in classical machine learning, and first employed in quantum simulators like Yao.jl. In contrast, our scheme derives directly from a recurrent form of quantum operators, and may be more familiar to a quantum computing community. Our strategy is very simple, uses only 'apply gate', 'clone state' and 'inner product' primitives and is hence straightforward to implement and integrate with existing simulators. It is compatible with gate parallelisation schemes, and hardware accelerated and distributed simulators. We describe the scheme in an instructive way, including details of how common gate derivatives can be performed, to clearly guide implementation in existing quantum simulators. We furthermore demonstrate the scheme by implementing it in Qiskit, and perform some comparative benchmarking with faithful simulation. Finally, we remark upon the difficulty of extending the scheme to density-matrix simulation of noisy channels.

arXiv comment11 pages, 2 figures, 4 algorithms

References in corpus (13)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Evaluating analytic gradients on quantum hardware
• Variational ansatz-based quantum simulation of imaginary time evolution
• ProjectQ: An Open Source Software Framework for Quantum Computing
• A Review of automatic differentiation and its efficient implementation
• Hybrid Quantum-Classical Approach to Quantum Optimal Control
• Variational quantum algorithms for discovering Hamiltonian spectra
• PennyLane: Automatic differentiation of hybrid quantum-classical computations
• Low-depth gradient measurements can improve convergence in variational hybrid quantum-classical algorithms
• Measuring Non-Hermitian Operators via Weak Values
• QuESTlink -- Mathematica embiggened by a hardware-optimised quantum emulator

Cited by in corpus (9)

• Quantum machine learning for image classification
• Quantum Machine Learning: from physics to software engineering
• QUARK: A Framework for Quantum Computing Application Benchmarking
• Hybrid quantum physics-informed neural networks for simulating computational fluid dynamics in complex shapes
• Quantum Deep Reinforcement Learning for Robot Navigation Tasks
• Subspace methods for the simulation of molecular response properties on a quantum computer
• Variational Optimization for Quantum Problems using Deep Generative Networks
• QDCNN: Quantum Dilated Convolutional Neural Network
• Efficient classical calculation of the Quantum Natural Gradient