Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.16795 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913442817900544 |
|---|---|
| author | Roux, Alet Zastawniak, Tomasz |
| author_facet | Roux, Alet Zastawniak, Tomasz |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_16795 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Accelerated Quantum Amplitude Estimation without QFT Roux, Alet Zastawniak, Tomasz Quantum Physics 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. |
| title | Accelerated Quantum Amplitude Estimation without QFT |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2407.16795 |