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:2309.07655

Phase shift rule with the optimal parameter selection

Liubov A. Markovich, S. Malikis, Stefano Polla, Jordi Tura i Brugués

Published Sep 14, 2023• 0 citations
arXivHTMLPDF

Abstract

The phase shift rules enable the estimation of the derivative of a quantum state with respect to phase parameters, providing valuable insights into the behavior and dynamics of quantum systems. This capability is essential in quantum simulation tasks where understanding the behavior of complex quantum systems is of interest, such as simulating chemical reactions or condensed matter systems. However, parameter shift rules are typically designed for Hamiltonian systems with equidistant eigenvalues. For systems with closely 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 lets derivatives be calculated for any system, regardless of how close the eigenvalues are to each other. It also optimizes the number of phase shifts, which reduces the amount of gate resources needed.

DOI
10.48550/arxiv.2309.07655

Related papers

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.

Physical Review A•Jun 21, 2024•6 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•306 citations

Overshifted parameter-shift rules: optimizing complex quantum systems with few measurements

Leonardo Banchi, Dominic Branford, Chetan Waghela

Abstract Gradient-based optimization is a key ingredient of variational quantum algorithms, with applications ranging from quantum machine learning to quantum chemistry and simulation. The parameter-shift rule provides a hardware-friendly method for evaluating gradients of expectation values with respect to circuit parameters, but its applicability is limited to circuits whose gate generators have a particular spectral structure. In this work, we present a generalized framework that, with optimal minimum measurement overhead, extends parameter shift rules beyond this restrictive setting to encompass basically arbitrary gate generator, possibly made of complicated multi-qubit interactions with unknown spectrum and, in some settings, even infinite dimensional systems such as those describing photonic devices or qubit-oscillator systems. Our generalization enables the use of more expressive quantum circuits in variational quantum optimization and enlarges its scope by harnessing all the available hardware degrees of freedom.

arXiv:2510.05289•Quantum Science and Technology•May 27, 2026•0 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•0 citations

Photonic parameter-shift rule: Enabling gradient computation for photonic quantum computers

Axel Pappalardo, Pierre-Emmanuel Emeriau, Giovanni de Felice +5 more

We present a method for gradient computation in quantum algorithms implemented on linear optical quantum computing platforms. While parameter-shift rules have become a staple in qubit gate-based quantum computing for calculating gradients, their direct application to photonic platforms has been hindered by the infinite dimensionality of phase-shift operators in Fock space. We introduce a photonic parameter-shift rule that overcomes this limitation, providing an exact formula for gradient computation in linear optical quantum processors. Our method scales linearly with the number of input photons and utilizes the same parametrized photonic circuit with shifted parameters for each evaluation. This advancement bridges a crucial gap in photonic quantum computing, enabling efficient gradient-based optimization for variational quantum algorithms on near-term photonic quantum processors. We demonstrate the efficacy of our approach through numerical simulations in quantum chemistry and generative modeling tasks, showing superior optimization performance as well as robustness to noise from finite sampling and photon distinguishability compared to other gradient-based and gradient-free methods.

arXiv:2410.02726•Physical Review A•Mar 25, 2025•11 citations

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

Artur F. Izmaylov, Robert A. Lang, Tzu-Ching Yen

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 parameter-shift rule to formulating these gradients as linear combinations of expectation values for generators with general eigenspectra (i.e., with more than two eigenvalues). Our approaches are exact and do not use any auxiliary qubits; instead they rely on a generator eigenspectrum analysis. Two main directions in the parameter-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 two or three 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 for commonly used two-qubit transformations (e.g., match gates, transmon gates, and fSim gates) and ${\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{S}}^{2}$-conserving fermionic operators for the variational quantum eigensolver.

arXiv:2107.08131•Physical Review A•Dec 29, 2021•54 citations
The phase shift rules enable the estimation of the derivative of a quantum state with respect to phase parameters, providing valuable insights into the behavior and dynamics of quantum systems. This capability is essential in quantum simulation tasks where understanding the behavior of complex quantum systems is of interest, such as simulating chemical reactions or condensed matter systems. However, parameter shift rules are typically designed for Hamiltonian systems with equidistant eigenvalues. For systems with closely 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 lets derivatives be calculated for any system, regardless of how close the eigenvalues are to each other. It also optimizes the number of phase shifts, which reduces the amount of gate resources needed.
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.
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.
Abstract Gradient-based optimization is a key ingredient of variational quantum algorithms, with applications ranging from quantum machine learning to quantum chemistry and simulation. The parameter-shift rule provides a hardware-friendly method for evaluating gradients of expectation values with respect to circuit parameters, but its applicability is limited to circuits whose gate generators have a particular spectral structure. In this work, we present a generalized framework that, with optimal minimum measurement overhead, extends parameter shift rules beyond this restrictive setting to encompass basically arbitrary gate generator, possibly made of complicated multi-qubit interactions with unknown spectrum and, in some settings, even infinite dimensional systems such as those describing photonic devices or qubit-oscillator systems. Our generalization enables the use of more expressive quantum circuits in variational quantum optimization and enlarges its scope by harnessing all the available hardware degrees of freedom.
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.
We present a method for gradient computation in quantum algorithms implemented on linear optical quantum computing platforms. While parameter-shift rules have become a staple in qubit gate-based quantum computing for calculating gradients, their direct application to photonic platforms has been hindered by the infinite dimensionality of phase-shift operators in Fock space. We introduce a photonic parameter-shift rule that overcomes this limitation, providing an exact formula for gradient computation in linear optical quantum processors. Our method scales linearly with the number of input photons and utilizes the same parametrized photonic circuit with shifted parameters for each evaluation. This advancement bridges a crucial gap in photonic quantum computing, enabling efficient gradient-based optimization for variational quantum algorithms on near-term photonic quantum processors. We demonstrate the efficacy of our approach through numerical simulations in quantum chemistry and generative modeling tasks, showing superior optimization performance as well as robustness to noise from finite sampling and photon distinguishability compared to other gradient-based and gradient-free methods.
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 parameter-shift rule to formulating these gradients as linear combinations of expectation values for generators with general eigenspectra (i.e., with more than two eigenvalues). Our approaches are exact and do not use any auxiliary qubits; instead they rely on a generator eigenspectrum analysis. Two main directions in the parameter-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 two or three 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 log2{log}_{2}log2​ (for generator decompositions). This allowed us to propose efficient differentiation schemes for commonly used two-qubit transformations (e.g., match gates, transmon gates, and fSim gates) and ${\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{S}}^{2}$-conserving fermionic operators for the variational quantum eigensolver.