Quantum algorithms for numerical differentiation of expected values with respect to parameters

• URL: http://arxiv.org/abs/2111.11016v1
• Date: Mon, 22 Nov 2021 06:50:25 GMT
• Title: Quantum algorithms for numerical differentiation of expected values with respect to parameters
• Authors: Koichi Miyamoto
• Abstract summary: We consider an expected value of a function of a variable and a real-valued parameter, and how to calculate derivatives of the expectation of the parameter. Based on QMCI and the general-order central difference formula for numerical differentiation, we propose two quantum methods for this problem. We see that, depending on the smoothness of the function and the number of qubits available, either of two methods is better than the other.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The quantum algorithms for Monte Carlo integration (QMCI), which are based on quantum amplitude estimation (QAE), speed up expected value calculation compared with classical counterparts, and have been widely investigated along with their applications to industrial problems such as financial derivative pricing. In this paper, we consider an expected value of a function of a stochastic variable and a real-valued parameter, and how to calculate derivatives of the expectation with respect to the parameter. This problem is related to calculating sensitivities of financial derivatives, and so of industrial importance. Based on QMCI and the general-order central difference formula for numerical differentiation, we propose two quantum methods for this problem, and evaluate their complexities. The first one, which we call the naive iteration method, simply calculates the formula by iterative computations and additions of the terms in it, and then estimates its expected value by QAE. The second one, which we name the sum-in-QAE method, performs the summation of the terms at the same time as the sum over the possible values of the stochastic variable in a single QAE. We see that, depending on the smoothness of the function and the number of qubits available, either of two methods is better than the other. In particular, when the function is nonsmooth or we want to save the qubit number, the sum-in-QAE method can be advantageous.

Related papers

• Calculating the expected value function of a two-stage stochastic optimization program with a quantum algorithm [0.0]
  Two-stage optimization involves calculating the expected cost of future decisions to inform the best decision in the present. We provide a quantum algorithm to estimate the expected value function in a two-stage optimization problem in time largely independent from the complexity of the random variable.
  arXiv  Detail & Related papers  (2024-02-23T00:07:34Z)
• Mixed State Variational Quantum Eigensolver for the Estimation of Expectation Values at Finite Temperature [0.0]
  We introduce a novel hybrid quantum-classical algorithm for the near-term computation of expectation values in quantum systems at finite temperatures. This is based on two stages: on the first one, a mixed state approximating a fiducial truncated density matrix is prepared through Variational Quantum Eigensolving (VQE) techniques. This is then followed by a reweighting stage where the expectation values for observables of interest are computed.
  arXiv  Detail & Related papers  (2024-01-30T17:29:58Z)
• 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)
• Phenomenological Theory of Variational Quantum Ground-State Preparation [0.0]
  The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a Hamiltonian exploiting parametrized quantum circuits. We show that the algorithm's success crucially depends on other parameters such as the learning rate. We propose a symmetry-enhanced simulation protocol that should be used if the gap closes.
  arXiv  Detail & Related papers  (2022-05-12T18:00:04Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Twisted hybrid algorithms for combinatorial optimization [68.8204255655161]
  Proposed hybrid algorithms encode a cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. We show that for levels $p=2,ldots, 6$, the level $p$ can be reduced by one while roughly maintaining the expected approximation ratio.
  arXiv  Detail & Related papers  (2022-03-01T19:47:16Z)
• On the properties of the asymptotic incompatibility measure in multiparameter quantum estimation [62.997667081978825]
  Incompatibility (AI) is a measure which quantifies the difference between the Holevo and the SLD scalar bounds. We show that the maximum amount of AI is attainable only for quantum statistical models characterized by a purity larger than $mu_sf min = 1/(d-1)$.
  arXiv  Detail & Related papers  (2021-07-28T15:16:37Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Improving the variational quantum eigensolver using variational adiabatic quantum computing [0.0]
  variational quantumsampling (VAQC) is a hybrid quantum-classical algorithm for finding a Hamiltonian minimum eigenvalue of a quantum circuit. We show that VAQC can provide more accurate solutions than "plain" VQE, for the evaluation.
  arXiv  Detail & Related papers  (2021-02-04T20:25:50Z)
• Contextual Subspace Variational Quantum Eigensolver [0.0]
  We describe a hybrid quantum-classical algorithm for approximating the ground state energy of a Hamiltonian. The number of qubits required to reach chemical accuracy can be reduced by more than a factor of two. This indicates that CS-VQE is a promising approach for eigenvalue computations on noisy intermediate-scale quantum devices.
  arXiv  Detail & Related papers  (2020-11-19T18:49:30Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)

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.