Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866918331267678208 |
|---|---|
| author | Pilatte, Cédric |
| author_facet | Pilatte, Cédric |
| contents | In 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multi-dimensional version of Shor's algorithm that requires far fewer quantum gates. His algorithm relies on a number-theoretic conjecture on the elements in $(\mathbb{Z}/N\mathbb{Z})^{\times}$ that can be written as short products of very small prime numbers. We prove a version of this conjecture using tools from analytic number theory such as zero-density estimates. As a result, we obtain an unconditional proof of correctness of this improved quantum algorithm and of subsequent variants. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_16450 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms Pilatte, Cédric Number Theory Computational Complexity Quantum Physics 68Q12, 11H06, 11M26, 11L40, 11Y05 In 1994, Shor introduced his famous quantum algorithm to factor integers and compute discrete logarithms in polynomial time. In 2023, Regev proposed a multi-dimensional version of Shor's algorithm that requires far fewer quantum gates. His algorithm relies on a number-theoretic conjecture on the elements in $(\mathbb{Z}/N\mathbb{Z})^{\times}$ that can be written as short products of very small prime numbers. We prove a version of this conjecture using tools from analytic number theory such as zero-density estimates. As a result, we obtain an unconditional proof of correctness of this improved quantum algorithm and of subsequent variants. |
| title | Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms |
| topic | Number Theory Computational Complexity Quantum Physics 68Q12, 11H06, 11M26, 11L40, 11Y05 |
| url | https://arxiv.org/abs/2404.16450 |