By now many in this forum would have likely read this paper that is being widely discussed.
Factoring integers with sublinear resources on a superconducting quantum processor
We demonstrate the
algorithm experimentally by factoring integers up to 48 bits with 10 superconducting qubits, the largest
integer factored on a quantum device. We estimate that a quantum circuit with 372 physical qubits and
a depth of thousands is necessary to challenge RSA-2048 using our algorithm.
Questions for this forum:
1) How feasible is this approach for RSA-2048 and above?
2) Some companies have informed they will release 1000 qubit+ processors as early as 2025. If claims in the paper holds true for higher qubits, shouldn't the industry move faster to adopt PQC (such as for CNSA suite 2.0 timelines)
3) Can this approach be modified to break elliptic curve cryptography?
4) With some updates, Can the approach in the paper be used against any currently known PQC ?