The Jacobi Factoring Circuit and Other Developments in Quantum Factoring

Explore groundbreaking advances in quantum integer factorization through this conference talk that examines how the computational cost landscape has dramatically shifted in recent years. Learn about the revolutionary Jacobi factoring circuit, which can factor integers of the form N=P²Q with qubit count and circuit depth scaling at approximately O(log Q), representing a significant improvement over traditional approaches. Discover how this circuit may provide the first efficiently verifiable proof of quantumness when parameters are appropriately chosen. Survey additional recent breakthroughs that have reduced circuit costs for integer factorization, including new methods applicable to RSA integers of the standard form N=PQ. Understand how these developments challenge the long-held assumption that quantum factorization requires prohibitively large quantum circuits, potentially moving integer factorization from a medium-to-long-term quantum computing application to a more near-term possibility, thirty years after Shor's seminal algorithm was first published.