Low depth algorithms for quantum amplitude estimation
Tudor Giurgica-Tiron, Iordanis Kerenidis, Farrokh Labib, Anupam, Prakash, William Zeng

TL;DR
This paper introduces two low-depth quantum amplitude estimation algorithms that balance quantum speedup and circuit complexity, enabling more practical quantum Monte Carlo methods.
Contribution
The paper presents novel low-depth algorithms for amplitude estimation that interpolate between classical and quantum approaches, with proven correctness and noise analysis.
Findings
Achieve optimal tradeoff between speedup and circuit depth
Work under regularity conditions for the log-likelihood function
Numerical comparisons show advantages over existing algorithms
Abstract
We design and analyze two new low depth algorithms for amplitude estimation (AE) achieving an optimal tradeoff between the quantum speedup and circuit depth. For , our algorithms require oracle calls and require the oracle to be called sequentially times to perform amplitude estimation within additive error . These algorithms interpolate between the classical algorithm and the standard quantum algorithm () and achieve a tradeoff . These algorithms bring quantum speedups for Monte Carlo methods closer to realization, as they can provide speedups with shallower circuits. The first algorithm (Power law AE) uses power law schedules in the framework introduced by Suzuki et al \cite{S20}. The algorithm works for and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Mathematical Approximation and Integration · Error Correcting Code Techniques
