Pitfalls of the sublinear QAOA-based factorization algorithm
| Autor: | Grebnev, Sergey V., Gavreev, Maxim A., Kiktenko, Evgeniy O., Guglya, Anton P., Efimov, Albert R., Fedorov, Aleksey K. |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | IEEE Access 11, 134760 (2023) |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1109/ACCESS.2023.3336989 |
| Popis: | Quantum computing devices are believed to be powerful in solving the prime factorization problem, which is at the heart of widely deployed public-key cryptographic tools. However, the implementation of Shor's quantum factorization algorithm requires significant resources scaling linearly with the number size; taking into account an overhead that is required for quantum error correction the estimation is that 20 millions of (noisy) physical qubits are required for factoring 2048-bit RSA key in 8 hours. Recent proposal by Yan et al. claims a possibility of solving the factorization problem with sublinear quantum resources. As we demonstrate in our work, this proposal lacks systematic analysis of the computational complexity of the classical part of the algorithm, which exploits the Schnorr's lattice-based approach. We provide several examples illustrating the need in additional resource analysis for the proposed quantum factorization algorithm. Comment: 19 pages, 2 figures, 3 tables; algorithm descriptions are extended |
| Databáze: | arXiv |
| Externí odkaz: |
|