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

• URL: http://arxiv.org/abs/2112.14669v2
• Date: Sun, 17 Apr 2022 16:38:36 GMT
• Title: Optimality of Finite-Support Parameter Shift Rules for Derivatives of Variational Quantum Circuits
• Authors: Dirk Oliver Theis
• Abstract summary: Variational (or, parameterized) quantum circuits are quantum circuits that contain real-number parameters. Shift rules have received attention as a way to obtain analytic derivatives, via statistical estimators. We show how the search for the shift rule with smallest standard deviation leads to a primal-dual pair of convex optimization problems.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Linear and non-linear relational analyses for Quantum Program Optimization [0.9208007322096532]
  We show that the phase folding optimization can be re-cast as an emphaffine relation analysis We show that the emphsum-over-paths technique can be used to extract precise symbolic transition relations for straightline circuits.
  arXiv  Detail & Related papers  (2024-10-30T22:57:07Z)
• Symmetry-informed transferability of optimal parameters in the Quantum Approximate Optimization Algorithm [0.0]
  We show how to translate an arbitrary set of optimal parameters into an adequate domain using the symmetries. We extend these results to general classical optimization problems described by Isatzing Hamiltonian variational ansatz for relevant physical models.
  arXiv  Detail & Related papers  (2024-07-05T13:37:53Z)
• Optimal Parameter Configurations for Sequential Optimization of Variational Quantum Eigensolver [5.005447280753645]
  Variational Quantum Eigensolver (VQE) is a hybrid algorithm for finding the minimum eigenvalue/vector of a given Hamiltonian. This paper focuses on the case where the components to be optimized are single-qubit gates.
  arXiv  Detail & Related papers  (2023-03-13T13:07:27Z)
• Non-Convex Optimization with Certificates and Fast Rates Through Kernel Sums of Squares [68.8204255655161]
  We consider potentially non- optimized approximation problems. In this paper, we propose an algorithm that achieves close to optimal a priori computational guarantees.
  arXiv  Detail & Related papers  (2022-04-11T09:37:04Z)
• Reducing the Variance of Gaussian Process Hyperparameter Optimization with Preconditioning [54.01682318834995]
  Preconditioning is a highly effective step for any iterative method involving matrix-vector multiplication. We prove that preconditioning has an additional benefit that has been previously unexplored. It simultaneously can reduce variance at essentially negligible cost.
  arXiv  Detail & Related papers  (2021-07-01T06:43:11Z)
• Direct Optimal Control Approach to Laser-Driven Quantum Particle Dynamics [77.34726150561087]
  We propose direct optimal control as a robust and flexible alternative to indirect control theory. The method is illustrated for the case of laser-driven wavepacket dynamics in a bistable potential.
  arXiv  Detail & Related papers  (2020-10-08T07:59:29Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• 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)
• Convergence of adaptive algorithms for weakly convex constrained optimization [59.36386973876765]
  We prove the $mathcaltilde O(t-1/4)$ rate of convergence for the norm of the gradient of Moreau envelope. Our analysis works with mini-batch size of $1$, constant first and second order moment parameters, and possibly smooth optimization domains.
  arXiv  Detail & Related papers  (2020-06-11T17:43:19Z)
• Hessian-based optimization of constrained quantum control [0.0]
  gradient-based textscgrape algorithm is successfully applied in a wide range of different branches of quantum physics. We derive and implement exact $2mathrmnd$ order analytical derivatives of the coherent dynamics. We demonstrate performance improvements for both the best and average errors of constrained unitary gate synthesis on a circuit-textscqed system.
  arXiv  Detail & Related papers  (2020-06-01T13:31:06Z)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.