A Major Step Forward in Quantum Factorization: Researchers unveil a new quantum factoring algorithm that could accelerate the arrival of “Q-day.”
A team of physicists has introduced a new quantum factoring method based on the Quantum Number Theoretic Transform (QNTT), which achieves major resource reductions compared with Shor’s algorithm, cutting gate count, circuit depth, and runtime by factors ranging from roughly 10× to over 1,000× in simulation and hardware tests. The findings, detailed in a new preprint, suggest that large-scale quantum attacks on classical cryptography could arrive much sooner than previously estimated, underscoring the urgent need for coordinated adoption of post-quantum cryptography and responsible disclosure practices.

This result suggests that “Q-day”, when quantum computers can break classical encryption, may be closer than previously thought, and it highlights the urgent need for accelerated post-quantum cryptography adoption and coordinated responsible disclosure.

📄 Read the full preprint here: https://www.preprints.org/frontend/manuscript/63009198e949e24aec54cb63dccf0ee1/download_pub