An Efficient Quantum Factoring Algorithm
Journal of the ACM · 28.02.2025 · 72 (1) · 1-13
DOI: 10.1145/3708471 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the ACM, online erschienen am 24.01.2025. Verfasst von Oded Regev. Die Arbeit wurde bisher 37-mal zitiert (Crossref) und nennt 23 Literaturangaben. Gefördert von: Simons Investigator Award from the Simons Foundation.
Abstract (Originalsprache)
We show that n -bit integers can be factorized by independently running a quantum circuit with \(\tilde{O}(n^{3/2})\) gates for \(\sqrt {n}+4\) times, and then using polynomial-time classical post-processing. The correctness of the algorithm relies on a certain number-theoretic conjecture. It is currently not clear if the algorithm can lead to improved physical implementations in practice.
Förderung
- Simons Investigator Award from the Simons Foundation
Zitieren
APA
Regev, O. (2025). An Efficient Quantum Factoring Algorithm. Journal of the ACM, 72(1), 1-13. https://doi.org/10.1145/3708471
Vancouver
Regev O. An Efficient Quantum Factoring Algorithm. Journal of the ACM. 2025;72(1):1-13. doi:10.1145/3708471
BibTeX
@article{Regev2025,
author = {Regev, Oded},
title = {An Efficient Quantum Factoring Algorithm},
journal = {Journal of the ACM},
year = {2025},
volume = {72},
number = {1},
pages = {1--13},
doi = {10.1145/3708471}
}
EUVIMED