Low-depth amplitude estimation without really trying
Open Access
- 26 July 2025
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Quantum Computing
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.Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- Quantum tomography using state-preparation unitaries2023
- A Sublinear-Time Quantum Algorithm for Approximating Partition Functions2023
- Iterative quantum amplitude estimationnpj Quantum Information, 2021
- Credit Risk Analysis Using Quantum ComputersIEEE Transactions on Computers, 2020
- Amplitude estimation without phase estimationQuantum Information Processing, 2020
- Quantum Approximate Counting, Simplified2020
- Quantum risk analysisnpj Quantum Information, 2019
- Quantum computational finance: Monte Carlo pricing of financial derivativesPhysical Review A, 2018
- Quantum speedup of Monte Carlo methodsProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2015
- Quantum amplitude amplification and estimation2002