The JVG Algorithm: A Critical Review

A recent paper introduced the JVG algorithm, claiming it as a significant improvement over Shor’s factoring algorithm. However, upon inspection, the algorithm’s key step is precomputing $x^r mod N$ on a classical computer and loading them into a quantum state.

Evaluating the JVG Algorithm

This approach is flawed because computing $x^r mod N$ for all $r$ takes exponential time, and loading them into a quantum computer also takes exponential time. Therefore, the JVG algorithm is not a viable solution for factoring large numbers.

Red Flags in the JVG Paper

The paper did not appear on the arXiv, and the authors named the algorithm after themselves, which raises suspicions. Additionally, the claim seems to have been amplified on clickbait news sites but ignored by reputable science outlets.

Experts have pointed out that the idea of hiding the actual work of solving a problem in a pre-computation step is a well-known way of lying about an algorithm’s speed. A similar approach that does work is the precomputation idea in Cleve and Watrous 2000, which allows parallelizing the quantum part of Shor’s algorithm to run in logarithmic depth.

Conclusion

In conclusion, the JVG algorithm is not a credible solution for factoring large numbers. Its flaws and red flags make it an example of how not to approach quantum algorithm design. As experts in the field, it is essential to critically evaluate claims and provide constructive feedback to promote genuine progress in quantum computing.

For more information on quantum algorithms and their applications, please visit our resources page.