Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations

Abstract

Optimization of unitary transformations in Variational Quantum Algorithms benefits highly from efficient evaluation of cost function gradients with respect to amplitudes of unitary generators. We propose several extensions of the parametric-shift-rule to formulating these gradients as linear combinations of expectation values for generators with general eigen-spectrum (i.e. with more than two eigenvalues). Our approaches are exact and do not use any auxiliary qubits, instead they rely on a generator eigen-spectrum analysis. Two main directions in the parametric-shift-rule extensions are 1) polynomial expansion of the exponential unitary operator based on a limited number of different eigenvalues in the generator and 2) decomposition of the generator as a linear combination of low-eigenvalue operators (e.g. operators with only 2 or 3 eigenvalues). These techniques have a range of scalings for the number of needed expectation values with the number of generator eigenvalues from quadratic (for polynomial expansion) to linear and even ${\log }_2$ (for generator decompositions). This allowed us to propose efficient differentiation schemes superior to previous approaches for commonly used 2-qubit transformations (e.g. match-gates, transmon and fSim gates) and ${\hat{S}}^2$-conserving fermionic operators for the variational quantum eigensolver.

References in corpus (3)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Matchgates and classical simulation of quantum circuits
• Generalized quantum circuit differentiation rules

Cited by in corpus (24)

• The Variational Quantum Eigensolver: a review of methods and best practices
• General parameter-shift rules for quantum gradients
• Quantum Machine Learning: from physics to software engineering
• Robust resource-efficient quantum variational ansatz through evolutionary algorithm
• Quantum Kernel Methods for Solving Differential Equations
• Analytical nonadiabatic couplings and gradients within the state-averaged orbital-optimized variational quantum eigensolver
• Variational quantum algorithm for experimental photonic multiparameter estimation
• Benchmarking variational quantum eigensolvers for the square-octagon-lattice Kitaev model
• AGP-based unitary coupled cluster theory for quantum computers
• Adaptive construction of shallower quantum circuits with quantum spin projection for fermionic systems
• Here comes the SU(N): multivariate quantum gates and gradients
• Unraveling correlated material properties with noisy quantum computers: Natural orbitalized variational quantum eigensolving of extended impurity models within a slave-boson approach
• Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping
• Partitioning Quantum Chemistry Simulations with Clifford Circuits
• Measurement-induced entanglement phase transitions in variational quantum circuits
• Analytical formulation of the second-order derivative of energy for orbital-optimized variational quantum eigensolver: application to polarizability
• Greedy Gradient-free Adaptive Variational Quantum Algorithms on a Noisy Intermediate Scale Quantum Computer
• Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles
• Iteration Complexity of Variational Quantum Algorithms
• Addition and Differentiation of ZX-diagrams
• Quantum natural gradient with thermal-state initialization
• Unbiased observable estimation with approximate channels in fault-tolerant quantum computation
• Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy
• A quantum eigenvalue solver based on tensor networks