REVIEW 2 cited by
Faster Amplitude Estimation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
In this paper, we introduce an efficient algorithm for the quantum amplitude estimation task which works in noisy intermediate-scale quantum(NISQ) devices. The quantum amplitude estimation is an important problem which has various applications in fields such as quantum chemistry, machine learning, and finance. Because the well-known algorithm for the quantum amplitude estimation using the phase estimation cannot be executed in NISQ devices, alternative approaches have been proposed in recent literature. Some of them provide a proof of the upper bound which almost achieves the Heisenberg scaling. However, the constant factor is large and thus the bound is loose. Our contribution in this paper is to provide the algorithm such that the upper bound of query complexity almost achieves the Heisenberg scaling and the constant factor is small.
Forward citations
Cited by 2 Pith papers
-
Quantum simulation of scattering amplitudes and interferences in perturbative QCD
A quantum circuit encodes QCD colour factors and diagram interferences in a measurement probability, with permuted identical-particle diagrams generated by swap sorting networks.
-
Quantum algorithms for the simulation of QCD processes in the perturbative regime
Quantum circuits for the colour algebra of perturbative QCD are presented and validated on a simulator, matching analytic colour factors for example diagrams.
Discussion (0). Continue with ORCID to comment.