Review of 'Factoring integers with sublinear resources on a superconducting quantum processor'

This article presents a quantum algorithm for integer factorization using sublinear resources, achieved by combining the classical Schnorr’s algorithm with a quantum approximate optimization algorithm (QAOA). The algorithm is demonstrated experimentally by factoring integers up to 48 bits with 10 superconducting qubits, and the authors estimate that a quantum circuit with 372 physical qubits and a depth of thousands is necessary to challenge RSA-2048 using this algorithm. The article is well-written and provides detailed information about the algorithm and experimental setup.

Some revisions that could improve the article include adding more information about the classical Schnorr’s algorithm and explaining the optimization process in more detail. The article could also benefit from more thorough explanations of the experimental setup, such as how the virtual-z gates are implemented and how the single-qubit rotations and CZ gates are achieved.

One potential weakness of the article is that it may be difficult for readers without a background in quantum computing to fully understand the technical details. Additionally, the article does not provide much discussion of the implications of this research for cryptography and information security.

The strength of the article is the clear presentation of the algorithm and experimental results, with detailed information about the number of qubits required and the largest integer that has been factored using this method. The experimental results are impressive, demonstrating the successful factorization of integers up to 48 bits using only 10 qubits.

Overall, this article presents an important advancement in quantum computing and integer factorization algorithms, with potential implications for cryptography and information security.