It looks like the “JVG algorithm” only wins on tiny numbers

4 days ago

The 'JVG algorithm' claims to be a massive improvement over Shor’s factoring algorithm, purportedly breaking RSA-2048 with only 5,000 physical qubits.
The algorithm's key idea involves precomputing x^r mod N classically and loading it into a quantum state, which is criticized for requiring exponential time and resources.
Critics highlight that the paper was not published on reputable platforms like arXiv but on 'Preprints.org,' raising suspicions about its credibility.
The claim gained traction on clickbait news sites but was ignored by reputable science outlets, further questioning its validity.
Experts point out that hiding computational work in a precomputation step is a known but flawed approach to falsely claim algorithmic efficiency.
The paper's flaws include impractical exponential resource requirements and lack of credible peer review or platform.
Alternative precomputation methods that actually work, like 'windowing,' are mentioned as valid approaches in quantum computing.
The authors naming the algorithm after themselves is seen as another red flag for dubious claims.

Hasty Briefsbeta