Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2112.14669

Optimality of Finite-Support Parameter Shift Rules for Derivatives of Variational Quantum Circuits

Dirk Oliver Theis

Published Dec 29, 2021• 5 citations
arXivHTMLPDF

Abstract

Variational (or, parameterized) quantum circuits are quantum circuits that contain real-number parameters, that need to be optimized/"trained" in order to achieve the desired quantum-computational effect. For that training, analytic derivatives (as opposed to numerical derivation) are useful. Parameter shift rules have received attention as a way to obtain analytic derivatives, via statistical estimators. In this paper, using Fourier Analysis, we characterize the set of all shift rules that realize a given fixed partial derivative of a multi-parameter VQC. Then, using Convex Optimization, we show how the search for the shift rule with smallest standard deviation leads to a primal-dual pair of convex optimization problems. We study these optimization problems theoretically, prove a strong duality theorem, and use it to establish optimal dual solutions for several families of VQCs. This also proves optimality for some known shift rules and answers the odd open question. As a byproduct, we demonstrate how optimal shift rules can be found efficiently computationally, and how the known optimal dual solutions help with that.

DOI
10.48550/arxiv.2112.14669

Related papers

Single-component gradient rules for variational quantum algorithms

Thomas Hubregtsen, Frederik Wilde, Shozab Qasim +1 more

Abstract Many near-term quantum computing algorithms are conceived as variational quantum algorithms, in which parameterized quantum circuits are optimized in a hybrid quantum–classical setup. Examples are variational quantum eigensolvers, quantum approximate optimization algorithms as well as various algorithms in the context of quantum-assisted machine learning. A common bottleneck of any such algorithm is constituted by the optimization of the variational parameters. A popular set of optimization methods work on the estimate of the gradient, obtained by means of circuit evaluations. We will refer to the way in which one can combine these circuit evaluations as gradient rules. This work provides a comprehensive picture of the family of gradient rules that vary parameters of quantum gates individually. The most prominent known members of this family are the parameter shift rule (PSR) and the finite differences method. To unite this family, we propose a generalized PSR that expresses all members of the aforementioned family as special cases, and discuss how all of these can be seen as providing access to a linear combination of exact first- and second-order derivatives. We further prove that a PSR with one non-shifted evaluation and only one shifted circuit evaluation does not exist, and introduce a novel perspective for approaching new gradient rules.

arXiv:2106.01388•Quantum Science and Technology•Apr 19, 2022•23 citations

General parameter-shift rules for quantum gradients

David Wierichs, Josh Izaac, Cody Wang +1 more

Variational quantum algorithms are ubiquitous in applications of noisy intermediate-scale quantum computers. Due to the structure of conventional parametrized quantum gates, the evaluated functions typically are finite Fourier series of the input parameters. In this work, we use this fact to derive new, general parameter-shift rules for single-parameter gates, and provide closed-form expressions to apply them. These rules are then extended to multi-parameter quantum gates by combining them with the stochastic parameter-shift rule. We perform a systematic analysis of quantum resource requirements for each rule, and show that a reduction in resources is possible for higher-order derivatives. Using the example of the quantum approximate optimization algorithm, we show that the generalized parameter-shift rule can reduce the number of circuit evaluations significantly when computing derivatives with respect to parameters that feed into many gates. Our approach additionally reproduces reconstructions of the evaluated function up to a chosen order, leading to known generalizations of the Rotosolve optimizer and new extensions of the quantum analytic descent optimization algorithm.

arXiv:2107.12390•Quantum•Mar 30, 2022•405 citations

Extended parameter-shift rules with minimal derivative variance for parameterized quantum circuits

Zhijian Lai, Jiang Hu, Dong An +1 more

Parameter shift rules (PSRs) are useful methods for computing arbitrary-order derivatives of the cost function in parameterized quantum circuits. The basic idea of PSRs is to evaluate the cost function at different parameter shifts, then use specific coefficients to combine them linearly to obtain the exact derivatives. In this work, we propose an extended parameter shift rule (EPSR) which generalizes a broad range of existing PSRs and has the following two advantages. First, EPSR offers an infinite number of possible parameter shifts, allowing the selection of the optimal parameter shifts to minimize the final derivative variance and thereby obtaining the more accurate derivative estimates with limited quantum resources. Second, EPSR extends the scope of the PSRs in the sense that EPSR can handle arbitrary Hermitian operator $H$ in gate $U(x) = \exp (iHx)$ in the parameterized quantum circuits, while existing PSRs are valid only for simple Hermitian generators $H$ such as simple Pauli words. Additionally, we show that the widely used ``general PSR'', introduced by Wierichs et al. (2022), is a special case of our EPSR, and we prove that it yields globally optimal shifts for minimizing the derivative variance under the weighted-shot scheme. Finally, through numerical simulations, we demonstrate the effectiveness of EPSR and show that the usage of the optimal parameter shifts indeed leads to more accurate derivative estimates.

arXiv:2508.08802•Physical Review Applied•Dec 5, 2025•1 citation

Parameter shift rule with optimal phase selection

Liubov A. Markovich, Savvas Malikis, Stefano Polla +1 more

Parameter shift rules enable the estimation of the derivatives of expectation values with respect to the dynamical evolution of a state. Thus, they provide a valuable tool in variational optimization and insight into the dynamical behavior of quantum systems. Constructing parameter shift rules applicable to complex dynamical generators is useful towards improving the control of analog quantum simulation devices and extending the applicability of variational quantum simulating methods. However, parameter shift rules are typically designed only for dynamical generators with highly degenerate or equidistant eigenvalues, such as Pauli operators, commonplace in the construction of parametrized quantum circuits. For generators with irregularly spaced eigenvalues, effective rules have not been established. We provide insights about the optimal design of a parameter shift rule tailored to various sorts of spectral information that may be available. The proposed method targets the calculation of any linear combination of $k\phantom{\rule{0.16em}{0ex}}\mathrm{th}$ derivatives with respect to the conjugate variable of a generator with a known spectrum, regardless of how close the eigenvalues are to each other. We discuss the optimal choice of parameter shifts, minimizing their number and the variance of the target estimator. Furthermore, we discuss the construction of parameter shift rules when only partial information about the generator spectrum is known.

arXiv:2309.07655•Physical Review A•Jun 21, 2024•9 citations

Stochastic parameter-shift rule for quantum metrology with general Hamiltonians

Le Bin Ho

Abstract Recently, quantum metrology with multiplicative Hamiltonians has been proposed in the variational quantum algorithms, from which the estimation precision can be adaptively optimized via the variational circuits. Systems with general Hamiltonians, however, still lack these variational schemes. This work introduces a quantum-circuit-based approach for studying quantum metrology with general Hamiltonians. We present a stochastic parameter-shift rule for the derivatives of the evolved quantum state under the parameterized gates in the circuit, whereby the quantum Fisher information can be obtained. Here the parameters are those we wish to estimate. We find that our scheme can be executed in universal quantum computers under the family of parameterized gates. Moreover, in the examples of the magnetic field estimation, we show the consistency between the results obtained from the stochastic parameter-shift rule and the exact results, while the results obtained from the standard parameter-shift rule slightly deviate from the exact ones. Our work sheds new light on studying quantum metrology with general Hamiltonians using quantum circuit algorithms.

•Jun 14, 2022•0 citations

Stochastic Shadow Descent: Training Parametrized Quantum Circuits with Shadows of Gradients

Sayantan Pramanik, M Girish Chandra

In this paper, we focus on the task of optimizing the parameters in Parametrized Quantum Circuits (PQCs). While popular algorithms, such as Simultaneous Perturbation Stochastic Approximation (SPSA), limit the number of circuit-execution to two per iteration, irrespective of the number of parameters in the circuit, they have their own challenges. These methods use central-differences to calculate biased estimates of directional derivatives. We show, both theoretically and numerically, that this may lead to instabilities in \emph{training} the PQCs. To remedy this, we propose Stochastic Shadow Descent (\texttt{SSD}), which uses random-projections (or \emph{shadows}) of the gradient to update the parameters iteratively. We eliminate the bias in directional derivatives by employing the Parameter-Shift Rule, along with techniques from Quantum Signal Processing, to construct a quantum circuit that parsimoniously computes \emph{unbiased estimates} of directional derivatives. Finally, we prove the convergence of the \texttt{SSD} algorithm, provide worst-case bounds on the number of iterations, and numerically demonstrate its efficacy.

quant-pharXiv:2511.12168•IEEE International Conference on Acoustics Speech and Signal Processing•Nov 18, 2025•2 citations
Variational (or, parameterized) quantum circuits are quantum circuits that contain real-number parameters, that need to be optimized/"trained" in order to achieve the desired quantum-computational effect. For that training, analytic derivatives (as opposed to numerical derivation) are useful. Parameter shift rules have received attention as a way to obtain analytic derivatives, via statistical estimators. In this paper, using Fourier Analysis, we characterize the set of all shift rules that realize a given fixed partial derivative of a multi-parameter VQC. Then, using Convex Optimization, we show how the search for the shift rule with smallest standard deviation leads to a primal-dual pair of convex optimization problems. We study these optimization problems theoretically, prove a strong duality theorem, and use it to establish optimal dual solutions for several families of VQCs. This also proves optimality for some known shift rules and answers the odd open question. As a byproduct, we demonstrate how optimal shift rules can be found efficiently computationally, and how the known optimal dual solutions help with that.
Abstract Many near-term quantum computing algorithms are conceived as variational quantum algorithms, in which parameterized quantum circuits are optimized in a hybrid quantum–classical setup. Examples are variational quantum eigensolvers, quantum approximate optimization algorithms as well as various algorithms in the context of quantum-assisted machine learning. A common bottleneck of any such algorithm is constituted by the optimization of the variational parameters. A popular set of optimization methods work on the estimate of the gradient, obtained by means of circuit evaluations. We will refer to the way in which one can combine these circuit evaluations as gradient rules. This work provides a comprehensive picture of the family of gradient rules that vary parameters of quantum gates individually. The most prominent known members of this family are the parameter shift rule (PSR) and the finite differences method. To unite this family, we propose a generalized PSR that expresses all members of the aforementioned family as special cases, and discuss how all of these can be seen as providing access to a linear combination of exact first- and second-order derivatives. We further prove that a PSR with one non-shifted evaluation and only one shifted circuit evaluation does not exist, and introduce a novel perspective for approaching new gradient rules.
Variational quantum algorithms are ubiquitous in applications of noisy intermediate-scale quantum computers. Due to the structure of conventional parametrized quantum gates, the evaluated functions typically are finite Fourier series of the input parameters. In this work, we use this fact to derive new, general parameter-shift rules for single-parameter gates, and provide closed-form expressions to apply them. These rules are then extended to multi-parameter quantum gates by combining them with the stochastic parameter-shift rule. We perform a systematic analysis of quantum resource requirements for each rule, and show that a reduction in resources is possible for higher-order derivatives. Using the example of the quantum approximate optimization algorithm, we show that the generalized parameter-shift rule can reduce the number of circuit evaluations significantly when computing derivatives with respect to parameters that feed into many gates. Our approach additionally reproduces reconstructions of the evaluated function up to a chosen order, leading to known generalizations of the Rotosolve optimizer and new extensions of the quantum analytic descent optimization algorithm.
Parameter shift rules (PSRs) are useful methods for computing arbitrary-order derivatives of the cost function in parameterized quantum circuits. The basic idea of PSRs is to evaluate the cost function at different parameter shifts, then use specific coefficients to combine them linearly to obtain the exact derivatives. In this work, we propose an extended parameter shift rule (EPSR) which generalizes a broad range of existing PSRs and has the following two advantages. First, EPSR offers an infinite number of possible parameter shifts, allowing the selection of the optimal parameter shifts to minimize the final derivative variance and thereby obtaining the more accurate derivative estimates with limited quantum resources. Second, EPSR extends the scope of the PSRs in the sense that EPSR can handle arbitrary Hermitian operator HHH in gate U(x)=exp⁡(iHx)U(x) = \exp (iHx)U(x)=exp(iHx) in the parameterized quantum circuits, while existing PSRs are valid only for simple Hermitian generators HHH such as simple Pauli words. Additionally, we show that the widely used ``general PSR'', introduced by Wierichs et al. (2022), is a special case of our EPSR, and we prove that it yields globally optimal shifts for minimizing the derivative variance under the weighted-shot scheme. Finally, through numerical simulations, we demonstrate the effectiveness of EPSR and show that the usage of the optimal parameter shifts indeed leads to more accurate derivative estimates.
Parameter shift rules enable the estimation of the derivatives of expectation values with respect to the dynamical evolution of a state. Thus, they provide a valuable tool in variational optimization and insight into the dynamical behavior of quantum systems. Constructing parameter shift rules applicable to complex dynamical generators is useful towards improving the control of analog quantum simulation devices and extending the applicability of variational quantum simulating methods. However, parameter shift rules are typically designed only for dynamical generators with highly degenerate or equidistant eigenvalues, such as Pauli operators, commonplace in the construction of parametrized quantum circuits. For generators with irregularly spaced eigenvalues, effective rules have not been established. We provide insights about the optimal design of a parameter shift rule tailored to various sorts of spectral information that may be available. The proposed method targets the calculation of any linear combination of kthk\phantom{\rule{0.16em}{0ex}}\mathrm{th}kth derivatives with respect to the conjugate variable of a generator with a known spectrum, regardless of how close the eigenvalues are to each other. We discuss the optimal choice of parameter shifts, minimizing their number and the variance of the target estimator. Furthermore, we discuss the construction of parameter shift rules when only partial information about the generator spectrum is known.
Abstract Recently, quantum metrology with multiplicative Hamiltonians has been proposed in the variational quantum algorithms, from which the estimation precision can be adaptively optimized via the variational circuits. Systems with general Hamiltonians, however, still lack these variational schemes. This work introduces a quantum-circuit-based approach for studying quantum metrology with general Hamiltonians. We present a stochastic parameter-shift rule for the derivatives of the evolved quantum state under the parameterized gates in the circuit, whereby the quantum Fisher information can be obtained. Here the parameters are those we wish to estimate. We find that our scheme can be executed in universal quantum computers under the family of parameterized gates. Moreover, in the examples of the magnetic field estimation, we show the consistency between the results obtained from the stochastic parameter-shift rule and the exact results, while the results obtained from the standard parameter-shift rule slightly deviate from the exact ones. Our work sheds new light on studying quantum metrology with general Hamiltonians using quantum circuit algorithms.
In this paper, we focus on the task of optimizing the parameters in Parametrized Quantum Circuits (PQCs). While popular algorithms, such as Simultaneous Perturbation Stochastic Approximation (SPSA), limit the number of circuit-execution to two per iteration, irrespective of the number of parameters in the circuit, they have their own challenges. These methods use central-differences to calculate biased estimates of directional derivatives. We show, both theoretically and numerically, that this may lead to instabilities in \emph{training} the PQCs. To remedy this, we propose Stochastic Shadow Descent (\texttt{SSD}), which uses random-projections (or \emph{shadows}) of the gradient to update the parameters iteratively. We eliminate the bias in directional derivatives by employing the Parameter-Shift Rule, along with techniques from Quantum Signal Processing, to construct a quantum circuit that parsimoniously computes \emph{unbiased estimates} of directional derivatives. Finally, we prove the convergence of the \texttt{SSD} algorithm, provide worst-case bounds on the number of iterations, and numerically demonstrate its efficacy.