.png){kind=icon}
返回
Pitfalls of the Sublinear QAOA-Based Factorization Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2023.3336989.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Integer factorization
lattice problems
quantum acceleration
QAOA
RSA
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Analyzing the performance of variational quantum factoring on a superconducting quantum processorOAAI
OAAI分享收藏Gamification framework model, based on social engagement in e-learning 2.0电子学习2.0中基于社会参与的游戏化框架模型
PREAI
分享收藏Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator使用陷阱离子量子模拟器对远程Ising模型进行量子近似优化
OAAI
OAAI分享收藏Experimental realization of Shor's quantum factoring algorithm using qubit recycling.png)
NATURE PHOTONICS
NATURE PHOTONICSIF32.9
PREAI
分享收藏Inductively-coupled argon plasma as an excitation source for flame atomic fluorescence spectrometry
PREAI
分享收藏分享收藏
查看更多内容