Random-depth Quantum Amplitude Estimation

• URL: http://arxiv.org/abs/2301.00528v4
• Date: Fri, 17 Nov 2023 09:01:50 GMT
• Title: Random-depth Quantum Amplitude Estimation
• Authors: Xi Lu and Hongwei Lin
• Abstract summary: MLAE is a practical solution to the quantum amplitude estimation problem with Heisenberg limit error convergence. We improve MLAE by using random depths to avoid the so-called critical points, and do numerical experiments to show that our algorithm is approximately unbiased compared to the original MLAE.
• Score: 5.996131518006461
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The maximum likelihood amplitude estimation algorithm (MLAE) is a practical solution to the quantum amplitude estimation problem with Heisenberg limit error convergence. We improve MLAE by using random depths to avoid the so-called critical points, and do numerical experiments to show that our algorithm is approximately unbiased compared to the original MLAE and approaches the Heisenberg limit better.

Related papers

• Comprehensive Study on Heisenberg-limited Quantum Algorithms for Multiple Observables Estimation [0.19999259391104385]
  We propose two practical variants of adaptive quantum gradient estimation (QGE) algorithm. We provide theoretical guarantee for the estimation precision in terms of the root mean squared error. We show how the estimation error is minimized under the circuit structure that resembles the phase estimation algorithm.
  arXiv  Detail & Related papers  (2025-05-01T17:57:27Z)
• An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem [49.1574468325115]
  We analyse the ability of quantum D-Wave annealers to find the maximum clique on a graph, expressed as a QUBO problem. We propose a decomposition algorithm for the complementary maximum independent set problem, and a graph generation algorithm to control the number of nodes, the number of cliques, the density, the connectivity indices and the ratio of the solution size to the number of other nodes.
  arXiv  Detail & Related papers  (2024-06-11T04:40:05Z)
• Adaptive measurement strategy for noisy quantum amplitude estimation with variational quantum circuits [0.3148661669593152]
  This paper studies the amplitude estimation in the presence of depolarizing noise with unknown intensity. We numerically show that the proposed method can nearly attain the quantum Cram'er-Rao bound (QCRB)
  arXiv  Detail & Related papers  (2024-05-24T03:15:56Z)
• Asymptotically Optimal Quantum Amplitude Estimation by Generalized Qubitization [5.0755851789013535]
  We first show that the standard deviationally lower bounded by approximately $1.28 L-1$, where $L$ is the number of queries. Then we propose a generalized qubitization that can block-encode several functions simultaneously, and show how it can help estimating quantum amplitude to achieve the optimal accuracy.
  arXiv  Detail & Related papers  (2023-06-29T05:31:52Z)
• 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)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• A randomized quantum algorithm for statistical phase estimation [8.701566919381223]
  We propose and rigorously analyse a randomized phase estimation algorithm with two distinctive features. First, our algorithm has complexity independent of the number of terms L in the Hamiltonian. Second, unlike previous L-independent approaches, all sources of error in our algorithm can be suppressed by collecting more data samples.
  arXiv  Detail & Related papers  (2021-10-22T21:26:35Z)
• Differentiable Annealed Importance Sampling and the Perils of Gradient Noise [68.44523807580438]
  Annealed importance sampling (AIS) and related algorithms are highly effective tools for marginal likelihood estimation. Differentiability is a desirable property as it would admit the possibility of optimizing marginal likelihood as an objective. We propose a differentiable algorithm by abandoning Metropolis-Hastings steps, which further unlocks mini-batch computation.
  arXiv  Detail & Related papers  (2021-07-21T17:10:14Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Stochastic Hard Thresholding Algorithms for AUC Maximization [49.00683387735522]
  We develop a hard thresholding algorithm for AUC in distributiond classification. We conduct experiments to show the efficiency and effectiveness of the proposed algorithms.
  arXiv  Detail & Related papers  (2020-11-04T16:49:29Z)
• Amplitude estimation via maximum likelihood on noisy quantum computer [3.5462326830737805]
  We give an experimental demonstration on a superconducting IBM Quantum device. We show that the proposed maximum likelihood estimator achieves quantum speedup in the number of queries.
  arXiv  Detail & Related papers  (2020-06-29T17:44: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.