Story perspectives

Breakthrough in Quantum Computing: Optimized Shor's Algorithm Factors 35

11/27/2025

28 3

Summary

Story summary

Researchers optimized Shor's algorithm for factoring 35 following Regev's approach, reducing space from O(n^{3/2}) to O(n log n) via novel qubit reuse inspired by reversible computing.
They validated the optimization by executing a simplified circuit on a superconducting quantum computer and retrieved the factors of 35.
The study highlights improved resource efficiency and circuit performance, even in noisy conditions, and suggests practical quantum factoring applications.

1 of 1

Story summary

Researchers optimized Shor's algorithm for factoring 35 following Regev's approach, reducing space from O(n^{3/2}) to O(n log n) via novel qubit reuse inspired by reversible computing.
They validated the optimization by executing a simplified circuit on a superconducting quantum computer and retrieved the factors of 35.
The study highlights improved resource efficiency and circuit performance, even in noisy conditions, and suggests practical quantum factoring applications.