So to factor a 2048-bit number, Shor's algorithm would need about 4000 qubits, and this algorithm would need about 126 qubits (log(2^2048)^(2/3)). I wonder whic

So to factor a 2048-bit number, Shor's algorithm would need about 4000 qubits, and this algorithm would need about 126 qubits (log(2^2048)^(2/3)). I wonder which would finish first: waiting for a 4000-qubit computer, and then factoring in exponentially faster time, or waiting for a 126-bit qubit computer, and then waiting for the sub-exponential algorithm to complete? :)