A new quantum decryption algorithm called JVG could significantly reduce the amount of resources needed to decrypt classical RSA encryption that we’ve been relying on for decades.
The JVG algorithm requires thousand-fold less quantum computer resources, such as qubits and quantum gates. Research extrapolations suggest it will require less than 5,000 qubits to break encryption methods used in RSA and ECC.
This was in 2020
DWave has 5,000 physical qubits. As per [2105.02208] Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems that’s about 120 logical qubits.
You need <5,000 logical qubits for JVG.
shows no number larger than 21 has yet been factored with Shor’s algorithm. No larger number than 8,219,999 has been factored by classical+quantum algorithms.
Wake me up when they factor the smallest usable, RSA-2048 semiprime challenge:
25195908475657893494027183240048398571429282126204032027777137836043662020707595556264018525880784406918290641249515082189298559149176184502808489120072844992687392807287776735971418347270261896375014971824691165077613379859095700097330459748808428401797429100642458691817195118746121515172654632282216869987549182422433637259085141865462043576798423387184774447920739934236584823824281198163815010674810451660377306056201619676256133844143603833904414952634432190114657544454178424020924616515723350778707749817125772467962926386356373289912154831438167899885040445364023527381951378636564391212010397122822120720357
So yeah, an improvement, but nowhere near what’s needed to break RSA. Still, the days are numbered so try to migrate to post-quantum suites where possible.
EDIT: Shtetl-Optimized » Blog Archive » The ”JVG algorithm” is crap seems to debunk the algorithm.