Low depth amplitude estimation without really trying

• URL: http://arxiv.org/abs/2410.01173v1
• Date: Wed, 2 Oct 2024 01:59:33 GMT
• Title: Low depth amplitude estimation without really trying
• Authors: Dinh-Long Vu, Bin Cheng, Patrick Rebentrost,
• Abstract summary: Quantum amplitude estimation algorithms provide quadratic speedup to Monte-Carlo simulations. They require a circuit depth that scales as inverse of the estimation error. We bypass this limitation by performing the classical Monte-Carlo method on the quantum algorithm itself.
• Score: 1.1005025875011782
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Standard quantum amplitude estimation algorithms provide quadratic speedup to Monte-Carlo simulations but require a circuit depth that scales as inverse of the estimation error. In view of the shallow depth in near-term devices, the precision achieved by these algorithms would be low. In this paper we bypass this limitation by performing the classical Monte-Carlo method on the quantum algorithm itself, achieving a higher than classical precision using low-depth circuits. We require the quantum algorithm to be weakly biased in order to avoid error accumulation during this process. Our method is parallel and can be as weakly biased as the constituent algorithm in some cases.

Related papers

• Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
  We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale. Our experiments show that this approach significantly outperforms the adiabatic algorithm.
  arXiv  Detail & Related papers  (2024-05-31T17:07:43Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• Quantum Algorithm for Signal Denoising [32.77959665599749]
  The proposed algorithm is able to process textitboth classical and quantum signals. Numerical results show that it is efficient at removing noise of both classical and quantum origin.
  arXiv  Detail & Related papers  (2023-12-24T05:16:04Z)
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer [27.84599956781646]
  We study the operation of a quantum-classical time-series algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a $16$-site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies.
  arXiv  Detail & Related papers  (2023-09-19T11:59:36Z)
• An adaptive Bayesian quantum algorithm for phase estimation [0.0]
  We present a coherence-based phase-estimation algorithm which can achieve the optimal quadratic scaling in the mean absolute error and the mean squared error. In the presence of noise, our algorithm produces errors that approach the theoretical lower bound.
  arXiv  Detail & Related papers  (2023-03-02T19:00:01Z)
• Improved maximum-likelihood quantum amplitude estimation [0.0]
  Quantum estimation is a key subroutine in a number of powerful quantum algorithms, including quantum-enhanced Monte Carlo simulation and quantum machine learning. In this article, we deepen the analysis of Maximum-likelihood quantum amplitude estimation (MLQAE) to put the algorithm in a more prescriptive form, including scenarios where quantum circuit depth is limited. We then propose and numerically validate a modification to the algorithm to overcome this problem, bringing the algorithm even closer to being useful as a practical subroutine on near- and mid-term quantum hardware.
  arXiv  Detail & Related papers  (2022-09-07T17:30:37Z)
• Adaptive Algorithm for Quantum Amplitude Estimation [13.82667502131475]
  We propose an adaptive algorithm for interval estimation of amplitudes. The proposed algorithm uses a similar number of quantum queries to achieve the same level of precision. We rigorously prove that the number of oracle queries achieves $O(1/epsilon)$, i.e., a quadratic speedup over classical Monte Carlo sampling.
  arXiv  Detail & Related papers  (2022-06-16T21:11:15Z)
• Black-Box Quantum State Preparation with Inverse Coefficients [17.63187488168065]
  Black-box quantum state preparation is a fundamental building block for many higher-level quantum algorithms. We present a new algorithm for performing black-box state preparation with inverse coefficients based on the technique of inequality test.
  arXiv  Detail & Related papers  (2021-12-11T09:22:25Z)
• Quantum algorithm for stochastic optimal stopping problems with applications in finance [60.54699116238087]
  The famous least squares Monte Carlo (LSM) algorithm combines linear least square regression with Monte Carlo simulation to approximately solve problems in optimal stopping theory. We propose a quantum LSM based on quantum access to a process, on quantum circuits for computing the optimal stopping times, and on quantum techniques for Monte Carlo.
  arXiv  Detail & Related papers  (2021-11-30T12:21:41Z)
• Low depth amplitude estimation on a trapped ion quantum computer [5.443245599372994]
  Amplitude estimation is a fundamental quantum algorithmic primitive that enables quantum computers to achieve quadratic speedups. Recent works have succeeded in somewhat reducing the necessary resources for such algorithms, by trading off some of the speedup for lower depth circuits. We report the results of an experimental demonstration of amplitude estimation on a state-of-the-art trapped ion quantum computer.
  arXiv  Detail & Related papers  (2021-09-20T16:57:19Z)
• A Gentle Introduction to Quantum Computing Algorithms with Applications to Universal Prediction [21.344529157722366]
  This technical report gives an elementary introduction to Quantum Computing for non-physicists. We describe some of the foundational Quantum Algorithms including: the Deutsch-Jozsa Algorithm, Shor's Algorithm, Grocer Search, and Quantum Counting Algorithm. We then attempt to use Quantum computing to find better algorithms for the approximation of Solomonoff Induction.
  arXiv  Detail & Related papers  (2020-04-29T11:46:52Z)

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.