2 papers
quant-ph2025
Space-Optimized and Experimental Implementations of Regev's Quantum Factoring Algorithm
Wentao Yang, Bao Yan, Muxi Zheng +3
The integer factorization problem (IFP) underpins the security of RSA, yet becomes efficiently solvable on a quantum computer through Shor's algorithm. Regev's recent high-dimensio…
quant-ph2025
Evidence of scaling advantage on an NP-Complete problem with enhanced quantum solvers
Quanfeng Lu, Shijie Wei, Keren Li +6
Achieving quantum advantage remains a key milestone in the noisy intermediate-scale quantum era. Without rigorous complexity proofs, scaling advantage-where quantum resource requir…