Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2301.00528

Random-depth Quantum Amplitude Estimation

Xi Lu, Hongwei Lin

Published Jan 2, 2023• 6 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.2301.00528

Related papers

Quantum multi-programming for maximum likelihood amplitude estimation

Pooja Rao, Sua Choi, Kwangmin Yu

A variant of QAE algorithm by Suzuki et al. called maximum likelihood amplitude estimation (MLAE) achieves the amplitude estimation by varying depths of Grover operators and post-processing for maximum likelihood estimation without the additional controlled operations and QFT. However, MLAE requires running multiple circuits of different depths of Grover operators. On the other hand, quantum multi-programming (QMP) is a computing method that executes multiple quantum circuits concurrently on a quantum computer. The quantum circuits executed concurrently can be different and even have different circuit depths. The main motivation of the QMP is that the number of qubits of NISQ computers is much greater than their quantum volume. In this work, using QMP in conjunction with MLAE makes it possible to run MLAE using a single circuit, thus requiring sampling much fewer times. We validate this algorithm for a numerical integration problem using NVIDIA’s open-source platform CUDA Quantum (simulator), Qiskit (simulator) and Quantinuum H2 device.

Quantum Computing, Communication, and Simulation•Mar 12, 2024•5 citations

Improved maximum-likelihood quantum amplitude estimation

Adam Callison, Dan E. Browne

Quantum amplitude estimation is a key subroutine in a number of powerful quantum algorithms, including quantum-enhanced Monte Carlo simulation and quantum machine learning. Maximum-likelihood quantum amplitude estimation (MLQAE) is one of a number of recent approaches that employ much simpler quantum circuits than the original algorithm based on quantum phase estimation. In this article, we deepen the analysis of MLQAE to put the algorithm in a more prescriptive form, including scenarios where quantum circuit depth is limited. In the process, we observe and explain particular ranges of `exceptional' values of the target amplitude for which the algorithm fails to achieve the desired precision. We then propose and numerically validate a heuristic 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:2209.03321•Sep 7, 2022•20 citations

Maximum-Likelihood Amplitude Estimation for Quantum Monte Carlo Integration on Trapped-Ion Hardware: Convergence, Noise-Floor Saturation, Depth-Dependent Bias

Aditi Lal, Alex Khan, Rut Lineswala +1 more

Quantum Amplitude Estimation promises to accelerate Monte Carlo integration by replacing the classical $\varepsilon \propto N^{-1/2}$ sampling law with the Heisenberg-limited $\varepsilon \propto N^{-1}$ scaling, but whether any part of that advantage survives on present-day hardware is an empirical question. We report a systematic experimental benchmark of a Maximum-Likelihood Amplitude Estimation QMC pipeline on IonQ trapped-ion processors, comprising 60 hardware trials on IonQ Forte-1 across five settings(5 & 9 qubits, 100-200 shots per depth, linear & exponential amplification schedules, ~113 device-hours), together with 100 trials on IonQ Aria-1 & Forte-1 noise models at 5, 9 & 19 qubits. The pipeline combines controlled-$R_y$ rotational state preparation, Grover-based amplitude amplification and maximum-likelihood inference and is benchmarked against $b_{\max}^{-1}\!\int_0^{b_{\max}}\!\sin^2\!x\,\mathrm{d}x$ with $b_{\max}=π/5$ ,given results emerge. First, the noiseless limit it attains $\varepsilon \propto N^{-0.88}$, close to the Heisenberg-scaling reference, reducing the error 54-74x over a 133x increase in oracle calls. Second, scaling does not survive on hardware. Every noisy backend saturates at an error floor of (2-5)x 10^{-2}, with fitted exponents of 0.04-0.15 on Forte-1 linear schedules and $α\le\!0$ on the vendor noise models: beyond the optimal shallow depth, however, deeper amplification provides no sustained accuracy gain and instead returns to the noise floor. Forte-1 hardware also outperformed IonQ's own Aria-1 noise model at every depth $m \ge 2$, indicating that vendor noise models are bad predictors of MLAE accuracy. The practical implication for UQ is that on current devices the useful operating point is a shallow, schedule-tuned amplification depth chosen so that the deepest circuit lands near p~1/2 not the deepest schedule the coherence budget allows.

quant-pharXiv:2609.25992•Sep 23, 2026•1 citation

The maximum-likelihood quantum amplitude estimation algorithm provides the best tradeoff between accuracy and circuit depth among quantum solutions for integral estimation

Marco Maronese, Massimiliano Incudini, Luca Asproni +1 more

The approximation of an integral with numerical integration methods is a relevant problem in many fields, from finance to chemistry. Monte Carlo methods are a family of methods widely used for numerical integration but which are not always applicable to industrial tasks. Instead, there are quantum computing methods such as Quantum Amplitude Estimation able to offer a speed-up compared to the Monte Carlo methods for numerical integration which promise a significant impact, especially in finance. The Quantum Amplitude Estimation algorithm is a fundamental quantum algorithm with the potential to achieve a quadratic speed-up. Unfortunately, being competitive over classical Monte Carlo methods would require hardware performances currently not available. Therefore, alternative methods have been developed in order to exploit fewer resources while maintaining an advantageous theoretical scaling. We present a comparison between the standard QAE algorithm and two NISQ-friendly versions of the QAE on a numerical integration task. The Monte Carlo technique of Metropolis-Hastings instead is used as a classical benchmark. The scaling of the different algorithms are evaluated in terms of estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the quantum solutions. The conclusion highlights that an alternative approach is preferable with respect to employng the phase estimation routine. Indeed, the maximum likelihood estimation guarantees the best trade-off between the length of the quantum circuits and the precision in the integral estimation.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•3 citations

The Quantum Amplitude Estimation Algorithms on Near-Term Devices: A Practical Guide

Marco Maronese, Massimiliano Incudini, Luca Asproni +1 more

The Quantum Amplitude Estimation (QAE) algorithm is a major quantum algorithm designed to achieve a quadratic speed-up. Until fault-tolerant quantum computing is achieved, being competitive over classical Monte Carlo (MC) remains elusive. Alternative methods have been developed so as to require fewer resources while maintaining an advantageous theoretical scaling. We compared the standard QAE algorithm with two Noisy Intermediate-Scale Quantum (NISQ)-friendly versions of QAE on a numerical integration task, with the Monte Carlo technique of Metropolis–Hastings as a classical benchmark. The algorithms were evaluated in terms of the estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the solutions, respectively. The effectiveness of the two QAE alternatives was tested on an 11-qubit trapped-ion quantum computer in order to verify which solution can first provide a speed-up in the integral estimation problems. We concluded that an alternative approach is preferable with respect to employing the phase estimation routine. Indeed, the Maximum Likelihood estimation guaranteed the best trade-off between the length of the quantum circuits and the precision in the integral estimation, as well as greater resistance to noise.

Quantum Reports•Dec 24, 2023•12 citations

Quantum amplitude estimation beyond power-of-two schedules

Farrokh Labib

Non-adaptive quantum amplitude estimation (QAE) fixes its Grover depths in advance, so every circuit can run in parallel, but it has so far needed more queries than the best adaptive methods. We show that most of this gap comes from two conventional choices: subspace-based post-processing and power-of-two depth ladders. We replace the first by the exact maximum-likelihood estimate, one matrix multiplication per batch of estimates, and the second by a geometric ladder with ratio $r \approx 1.45$. The result is a fully parallel, deterministic-schedule estimator with total query complexity $2.8$-$3.1/\varepsilon$ at 95% confidence for target errors from $3.5\times 10^{-3}$ to $10^{-6}$. This matches the average-case complexity of chebAE, the best benchmarked adaptive method, within statistical uncertainty (with the lower point estimate at every scale tested), beats its maximum-observed complexity by $1.6\times$, and needs a maximum sequential depth of only $0.21/\varepsilon$ against chebAE's $2.9/\varepsilon$. Relative to csAE, the best non-adaptive benchmark, the constants improve by 30-35% at 95% and $1.5$-$1.7\times$ at 99% confidence. The optimal ratio has a simple origin. Doubling is the fastest depth growth at which the data can still tell neighboring candidate values apart, so power-of-two ladders sit at the edge of confusion and must buy reliability with extra shots; a slightly denser ladder checks every scale redundantly. An error-probability analysis reproduces the measured failure rates and locates the optimum. The likelihood formulation extends directly to noise-aware estimation, and uniformly scaling the capped ladder covers the depth-limited regime, realizing the optimal trade-off $M N_{\mathrm{tot}} \approx (0.4$-$0.6)/\varepsilon^2$ within $\sim 1.1\times$ of the schedule's Cramér-Rao limit.

quant-pharXiv:2609.02715•Sep 3, 2026•0 citations
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.
A variant of QAE algorithm by Suzuki et al. called maximum likelihood amplitude estimation (MLAE) achieves the amplitude estimation by varying depths of Grover operators and post-processing for maximum likelihood estimation without the additional controlled operations and QFT. However, MLAE requires running multiple circuits of different depths of Grover operators. On the other hand, quantum multi-programming (QMP) is a computing method that executes multiple quantum circuits concurrently on a quantum computer. The quantum circuits executed concurrently can be different and even have different circuit depths. The main motivation of the QMP is that the number of qubits of NISQ computers is much greater than their quantum volume. In this work, using QMP in conjunction with MLAE makes it possible to run MLAE using a single circuit, thus requiring sampling much fewer times. We validate this algorithm for a numerical integration problem using NVIDIA’s open-source platform CUDA Quantum (simulator), Qiskit (simulator) and Quantinuum H2 device.
Quantum amplitude estimation is a key subroutine in a number of powerful quantum algorithms, including quantum-enhanced Monte Carlo simulation and quantum machine learning. Maximum-likelihood quantum amplitude estimation (MLQAE) is one of a number of recent approaches that employ much simpler quantum circuits than the original algorithm based on quantum phase estimation. In this article, we deepen the analysis of MLQAE to put the algorithm in a more prescriptive form, including scenarios where quantum circuit depth is limited. In the process, we observe and explain particular ranges of `exceptional' values of the target amplitude for which the algorithm fails to achieve the desired precision. We then propose and numerically validate a heuristic 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.
Quantum Amplitude Estimation promises to accelerate Monte Carlo integration by replacing the classical ε∝N−1/2\varepsilon \propto N^{-1/2}ε∝N−1/2 sampling law with the Heisenberg-limited ε∝N−1\varepsilon \propto N^{-1}ε∝N−1 scaling, but whether any part of that advantage survives on present-day hardware is an empirical question. We report a systematic experimental benchmark of a Maximum-Likelihood Amplitude Estimation QMC pipeline on IonQ trapped-ion processors, comprising 60 hardware trials on IonQ Forte-1 across five settings(5 & 9 qubits, 100-200 shots per depth, linear & exponential amplification schedules, ~113 device-hours), together with 100 trials on IonQ Aria-1 & Forte-1 noise models at 5, 9 & 19 qubits. The pipeline combines controlled-RyR_yRy​ rotational state preparation, Grover-based amplitude amplification and maximum-likelihood inference and is benchmarked against bmax⁡−1 ⁣∫0bmax⁡ ⁣sin⁡2 ⁣x dxb_{\max}^{-1}\!\int_0^{b_{\max}}\!\sin^2\!x\,\mathrm{d}xbmax−1​∫0bmax​​sin2xdx with bmax⁡=π/5b_{\max}=π/5bmax​=π/5 ,given results emerge. First, the noiseless limit it attains ε∝N−0.88\varepsilon \propto N^{-0.88}ε∝N−0.88, close to the Heisenberg-scaling reference, reducing the error 54-74x over a 133x increase in oracle calls. Second, scaling does not survive on hardware. Every noisy backend saturates at an error floor of (2-5)x 10^{-2}, with fitted exponents of 0.04-0.15 on Forte-1 linear schedules and α≤ ⁣0α\le\!0α≤0 on the vendor noise models: beyond the optimal shallow depth, however, deeper amplification provides no sustained accuracy gain and instead returns to the noise floor. Forte-1 hardware also outperformed IonQ's own Aria-1 noise model at every depth m≥2m \ge 2m≥2, indicating that vendor noise models are bad predictors of MLAE accuracy. The practical implication for UQ is that on current devices the useful operating point is a shallow, schedule-tuned amplification depth chosen so that the deepest circuit lands near p~1/2 not the deepest schedule the coherence budget allows.
The approximation of an integral with numerical integration methods is a relevant problem in many fields, from finance to chemistry. Monte Carlo methods are a family of methods widely used for numerical integration but which are not always applicable to industrial tasks. Instead, there are quantum computing methods such as Quantum Amplitude Estimation able to offer a speed-up compared to the Monte Carlo methods for numerical integration which promise a significant impact, especially in finance. The Quantum Amplitude Estimation algorithm is a fundamental quantum algorithm with the potential to achieve a quadratic speed-up. Unfortunately, being competitive over classical Monte Carlo methods would require hardware performances currently not available. Therefore, alternative methods have been developed in order to exploit fewer resources while maintaining an advantageous theoretical scaling. We present a comparison between the standard QAE algorithm and two NISQ-friendly versions of the QAE on a numerical integration task. The Monte Carlo technique of Metropolis-Hastings instead is used as a classical benchmark. The scaling of the different algorithms are evaluated in terms of estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the quantum solutions. The conclusion highlights that an alternative approach is preferable with respect to employng the phase estimation routine. Indeed, the maximum likelihood estimation guarantees the best trade-off between the length of the quantum circuits and the precision in the integral estimation.
The Quantum Amplitude Estimation (QAE) algorithm is a major quantum algorithm designed to achieve a quadratic speed-up. Until fault-tolerant quantum computing is achieved, being competitive over classical Monte Carlo (MC) remains elusive. Alternative methods have been developed so as to require fewer resources while maintaining an advantageous theoretical scaling. We compared the standard QAE algorithm with two Noisy Intermediate-Scale Quantum (NISQ)-friendly versions of QAE on a numerical integration task, with the Monte Carlo technique of Metropolis–Hastings as a classical benchmark. The algorithms were evaluated in terms of the estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the solutions, respectively. The effectiveness of the two QAE alternatives was tested on an 11-qubit trapped-ion quantum computer in order to verify which solution can first provide a speed-up in the integral estimation problems. We concluded that an alternative approach is preferable with respect to employing the phase estimation routine. Indeed, the Maximum Likelihood estimation guaranteed the best trade-off between the length of the quantum circuits and the precision in the integral estimation, as well as greater resistance to noise.
Non-adaptive quantum amplitude estimation (QAE) fixes its Grover depths in advance, so every circuit can run in parallel, but it has so far needed more queries than the best adaptive methods. We show that most of this gap comes from two conventional choices: subspace-based post-processing and power-of-two depth ladders. We replace the first by the exact maximum-likelihood estimate, one matrix multiplication per batch of estimates, and the second by a geometric ladder with ratio r≈1.45r \approx 1.45r≈1.45. The result is a fully parallel, deterministic-schedule estimator with total query complexity 2.82.82.8-3.1/ε3.1/\varepsilon3.1/ε at 95% confidence for target errors from 3.5×10−33.5\times 10^{-3}3.5×10−3 to 10−610^{-6}10−6. This matches the average-case complexity of chebAE, the best benchmarked adaptive method, within statistical uncertainty (with the lower point estimate at every scale tested), beats its maximum-observed complexity by 1.6×1.6\times1.6×, and needs a maximum sequential depth of only 0.21/ε0.21/\varepsilon0.21/ε against chebAE's 2.9/ε2.9/\varepsilon2.9/ε. Relative to csAE, the best non-adaptive benchmark, the constants improve by 30-35% at 95% and 1.51.51.5-1.7×1.7\times1.7× at 99% confidence. The optimal ratio has a simple origin. Doubling is the fastest depth growth at which the data can still tell neighboring candidate values apart, so power-of-two ladders sit at the edge of confusion and must buy reliability with extra shots; a slightly denser ladder checks every scale redundantly. An error-probability analysis reproduces the measured failure rates and locates the optimum. The likelihood formulation extends directly to noise-aware estimation, and uniformly scaling the capped ladder covers the depth-limited regime, realizing the optimal trade-off MNtot≈(0.4M N_{\mathrm{tot}} \approx (0.4MNtot​≈(0.4-0.6)/ε20.6)/\varepsilon^20.6)/ε2 within ∼1.1×\sim 1.1\times∼1.1× of the schedule's Cramér-Rao limit.