Generalized quantum circuit differentiation rules

Abstract

Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits with respect to underlying parameters. Here, we propose the rules for differentiating quantum circuits (unitaries) with arbitrary generators. Unlike the standard parameter shift rule valid for unitaries generated by operators with spectra limited to at most two unique eigenvalues (represented by involutory and idempotent operators), our approach also works for generators with a generic non-degenerate spectrum. Based on a spectral decomposition, we derive a simple recipe that allows explicit derivative evaluation. The derivative corresponds to the weighted sum of measured expectations for circuits with shifted parameters. The number of function evaluations is equal to the number of unique positive non-zero spectral gaps (eigenvalue differences) for the generator. We apply the approach to relevant examples of two-qubit gates, among others showing that the fSim gate can be differentiated using four measurements. Additionally, we present generalized differentiation rules for the case of Pauli string generators, based on distinct shifts (here named as the triangulation approach), and analyse the variance for derivative measurements in different scenarios. Our work offers a toolbox for the efficient hardware-oriented differentiation needed for circuit optimization and operator-based derivative representation.

expanded discussion and fixed typos; close to published version

References in corpus (12)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• A Quantum Approximate Optimization Algorithm
• An introduction to quantum machine learning
• Quantum computing with neutral atoms
• Experimental quantum speed-up in reinforcement learning agents
• Microwave-engineering of programmable XXZ Hamiltonians in arrays of Rydberg atoms
• Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
• An end-to-end trainable hybrid classical-quantum classifier
• A Feasible Approach for Automatically Differentiable Unitary Coupled-Cluster on Quantum Computers
• Quantum Quantile Mechanics: Solving Stochastic Differential Equations for Generating Time-Series
• Calculus on parameterized quantum circuits

Cited by in corpus (16)

• General parameter-shift rules for quantum gradients
• Variational Quantum Reinforcement Learning via Evolutionary Optimization
• Quantum Machine Learning: from physics to software engineering
• Recent advances for quantum classifiers
• Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations
• Quantum Kernel Methods for Solving Differential Equations
• Optimizing quantum circuits with Riemannian gradient flow
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
• Randomized adaptive quantum state preparation
• Protocols for classically training quantum generative models on probability distributions
• Measurement-induced entanglement phase transitions in variational quantum circuits
• Protocols for Trainable and Differentiable Quantum Generative Modelling
• Calculation of the moscovium ground-state energy by quantum algorithms
• Addition and Differentiation of ZX-diagrams
• Quantum Model-Discovery