Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2505.00433 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912429466714112 |
|---|---|
| author | Abbassi, Ali Bayle, Lionel |
| author_facet | Abbassi, Ali Bayle, Lionel |
| contents | This paper aims to determine the exact success probability at each step of Shor's algorithm. Although the literature usually provides a lower bound on this probability, we present an improved bound. The derived formulas enable the identification of all failure cases in Shor's algorithm, which correspond to a success probability of zero. A simulation routine is provided to evaluate the theoretical success probability for a given integer when its prime factorization is known with potential applications in quantum resource estimation and algorithm benchmarking. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_00433 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Success probability in Shor's Algorithm Abbassi, Ali Bayle, Lionel Quantum Physics Data Structures and Algorithms 81P68 20B05 11Y05 This paper aims to determine the exact success probability at each step of Shor's algorithm. Although the literature usually provides a lower bound on this probability, we present an improved bound. The derived formulas enable the identification of all failure cases in Shor's algorithm, which correspond to a success probability of zero. A simulation routine is provided to evaluate the theoretical success probability for a given integer when its prime factorization is known with potential applications in quantum resource estimation and algorithm benchmarking. |
| title | Success probability in Shor's Algorithm |
| topic | Quantum Physics Data Structures and Algorithms 81P68 20B05 11Y05 |
| url | https://arxiv.org/abs/2505.00433 |