Evaluation of derivatives using approximate generalized parameter shift rule

• URL: http://arxiv.org/abs/2505.18090v2
• Date: Fri, 13 Jun 2025 10:08:20 GMT
• Title: Evaluation of derivatives using approximate generalized parameter shift rule
• Authors: Vytautas Abramavicius, Evan Philip, Kaonan Micadei, Charles Moussa, Mario Dagrada, Vincent E. Elfving, Panagiotis Barkoutsos, Roland Guichard,
• Abstract summary: We present the approximate generalized parameter rule (aGPSR) that can handle arbitrary device Hamiltonians.<n>When applying aGPSR for a variational quantum eigensolver test case ranging from 3 to 6 qubits, the number of expectation calls is reduced by a factor ranging from 7 to 504.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Parameter shift rules are instrumental for derivatives estimation in a wide range of quantum algorithms, especially in the context of Quantum Machine Learning. Application of single-gap parameter shift rule is often not possible in algorithms running on noisy intermediate-scale quantum (NISQ) hardware due to noise effects and interaction between device qubits. In such cases, generalized parameter shift rules must be applied yet are computationally expensive for larger systems. In this paper we present the approximate generalized parameter rule (aGPSR) that can handle arbitrary device Hamiltonians and provides an accurate derivative estimation while significantly reducing the computational requirements. When applying aGPSR for a variational quantum eigensolver test case ranging from 3 to 6 qubits, the number of expectation calls is reduced by a factor ranging from 7 to 504 while reaching the exact same target energy, demonstrating its huge computational savings capabilities.

Related papers

• Non-perturbative switching rates in bistable open quantum systems: from driven Kerr oscillators to dissipative cat qubits [72.41778531863143]
  We use path integral techniques to predict the switching rate in a single-mode bistable open quantum system.<n>Our results open new avenues for exploring switching phenomena in multistable single- and many-body open quantum systems.
  arXiv  Detail & Related papers  (2025-07-24T18:01:36Z)
• Fast Expectation Value Calculation Speedup of Quantum Approximate Optimization Algorithm: HoLCUs QAOA [55.2480439325792]
  We present a new method for calculating expectation values of operators that can be expressed as a linear combination of unitary (LCU) operators.<n>This method is general for any quantum algorithm and is of particular interest in the acceleration of variational quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-03T17:15:23Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Randomized semi-quantum matrix processing [0.0]
  We present a hybrid quantum-classical framework for simulating generic matrix functions. The method is based on randomization over the Chebyshev approximation of the target function. We prove advantages on average depths, including quadratic speed-ups on costly parameters.
  arXiv  Detail & Related papers  (2023-07-21T18:00:28Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Error Mitigation-Aided Optimization of Parameterized Quantum Circuits: Convergence Analysis [42.275148861039895]
  Variational quantum algorithms (VQAs) offer the most promising path to obtaining quantum advantages via noisy processors. gate noise due to imperfections and decoherence affects the gradient estimates by introducing a bias. Quantum error mitigation (QEM) techniques can reduce the estimation bias without requiring any increase in the number of qubits. QEM can reduce the number of required iterations, but only as long as the quantum noise level is sufficiently small.
  arXiv  Detail & Related papers  (2022-09-23T10:48:04Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• General parameter-shift rules for quantum gradients [0.03823356975862005]
  Variational quantum algorithms are ubiquitous in applications of noisy intermediate-scale quantum computers. We show that a general parameter-shift rule can reduce the number of circuit evaluations significantly. Our approach additionally reproduces reconstructions of the evaluated function up to a chosen order, leading to known generalizations of the Rotosolve algorithm.
  arXiv  Detail & Related papers  (2021-07-26T18:00:02Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• A variational quantum eigensolver for dynamic correlation functions [0.9176056742068814]
  We show how the calculation of zero-temperature dynamic correlation functions can be recast into a modified VQE algorithm. This allows for important physical expectation values describing the dynamics of the system to be directly converged on the frequency axis. We believe the approach shows potential for the extraction of frequency dynamics of correlated systems on near-term quantum processors.
  arXiv  Detail & Related papers  (2021-05-04T18:52:45Z)
• Estimating the gradient and higher-order derivatives on quantum hardware [1.2891210250935146]
  We show how arbitrary-order derivatives can be analytically evaluated in terms of simple parameter-shift rules. We also consider the impact of statistical noise by studying the mean squared error of different derivative estimators.
  arXiv  Detail & Related papers  (2020-08-14T18:00:10Z)
• Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule [0.0]
  We study the problem of estimating the gradient of the function to be optimized directly from quantum measurements. We derive a mathematically exact formula that provides an algorithm for estimating the gradient of any multi-qubit parametric quantum evolution. Our algorithm continues to work, although with some approximations, even when all the available quantum gates are noisy.
  arXiv  Detail & Related papers  (2020-05-20T18:24:11Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Programming a quantum computer with quantum instructions [39.994876450026865]
  We use a density matrixiation protocol to execute quantum instructions on quantum data. A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
  arXiv  Detail & Related papers  (2020-01-23T22:43:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.