Low depth algorithms for quantum amplitude estimation

by   Tudor Giurgica-Tiron, et al.

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 β∈ (0,1], our algorithms require N= O( 1/ϵ^1+β) oracle calls and require the oracle to be called sequentially D= O( 1/ϵ^1-β) times to perform amplitude estimation within additive error ϵ. These algorithms interpolate between the classical algorithm (β=1) and the standard quantum algorithm (β=0) and achieve a tradeoff ND= O(1/ϵ^2). 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 <cit.>. The algorithm works for β∈ (0,1] and has provable correctness guarantees when the log-likelihood function satisfies regularity conditions required for the Bernstein Von-Mises theorem. The second algorithm (QoPrime AE) uses the Chinese remainder theorem for combining lower depth estimates to achieve higher accuracy. The algorithm works for discrete β =q/k where k ≥ 2 is the number of distinct coprime moduli used by the algorithm and 1 ≤ q ≤ k-1, and has a fully rigorous correctness proof. We analyze both algorithms in the presence of depolarizing noise and provide experimental comparisons with the state of the art amplitude estimation algorithms.


page 1

page 2

page 3

page 4


Adaptive Algorithm for Quantum Amplitude Estimation

Quantum amplitude estimation is a key sub-routine of a number of quantum...

Automatic Generation of an Efficient Less-Than Oracle for Quantum Amplitude Amplification

Grover's algorithm is a well-known contribution to quantum computing. It...

Quantum machine learning with subspace states

We introduce a new approach for quantum linear algebra based on quantum ...

Quantum Chebyshev's Inequality and Applications

In this paper we provide new quantum algorithms with polynomial speed-up...

Quantum Topological Data Analysis with Linear Depth and Exponential Speedup

Quantum computing offers the potential of exponential speedups for certa...

Few Quantum Algorithms on Amplitude Distribution

Amplitude filtering is concerned with identifying basis-states in a supe...

Quantum and Randomised Algorithms for Non-linearity Estimation

Non-linearity of a Boolean function indicates how far it is from any lin...

Please sign up or login with your details

Forgot password? Click here to reset