Quantum computers factoring large numbers is still only theoretical

Chinese researchers recently published a paper on the preprint platform arxiv, reporting that the number of qubits required to crack a 2048-bit RSA key can be significantly reduced, and existing quantum computers can do it. Renowned quantum computing expert Scott Aaronson thinks the paper is wrong. The optimization method proposed by the Chinese researchers is based on Peter Schnorr’s algorithm, which is a lattice-based classical algorithm, and Schnorr claims to use a heuristic quantum optimization method called QAOA. The authors of the paper acknowledge that the convergence of QAOA is ambiguous, and its accelerated factorization of large numbers has not yet been demonstrated. Scott Aaronson made it clear that this paper is one of the most misleading quantum computing papers he has ever seen.

This article is transferred from: https://www.solidot.org/story?sid=73834
This site is only for collection, and the copyright belongs to the original author.