>The number of qubits required is O(logN/loglog N), which is sublinear in the bit length of the integer N, making it the most qubit-saving factorization algorithm to date. 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.
@newt i am aware of that, that is why i am talking about the near future and not the distant future... I fear that RSA-2048 will fall in the next few years and after that it wont be that long until RSA-4086 is also broken
@Jain not necessarily. I always hate articles like this, because they are sensational in nature and often hide smurky details. Like, the fact that quantum computers are inherently probabilistic in nature, or that the more qbits you entangle with each other, the greater chance of error.