Quick Navigation

Topics

Trapped Ion Quantum Computing

Accelerated Quantum Amplitude Estimation without QFT

arXiv
Authors: Alet Roux, Tomasz Zastawniak

Year

2024

Paper ID

65046

Status

Preprint

Abstract Read

~2 min

Abstract Words

117

Citations

N/A

Abstract

We put forward a Quantum Amplitude Estimation algorithm delivering superior performance (lower quantum computational complexity and faster classical computation parts) compared to the approaches available to-date. The algorithm does not relay on the Quantum Fourier Transform and its quantum computational complexity is of order O\(frac{1}{varepsilon}\) in terms of the target accuracy varepsilon>0. The O\(frac{1}{varepsilon}\) bound on quantum computational complexity is also superior compared to those in the earlier approaches due to smaller constants. Moreover, a much tighter bound is obtained by means of computer-assisted estimates for the expected value of quantum computational complexity. The correctness of the algorithm and the O\(frac{1}{varepsilon}\) bound on quantum computational complexity are supported by precise proofs.

Why This Paper Matters

  • This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
  • It adds a 2024 reference point for readers tracking recent quantum research.
  • We put forward a Quantum Amplitude Estimation algorithm delivering superior performance (lower quantum computational complexity and faster classical computation parts) compared...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #65046

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.