Back to News
quantum-computing

Regev's Quantum Factoring Algorithm Achieves Space Reduction Enabling Practical Implementation

/u/Tsmacks1
Loading...
3 min read
0 likes
⚡ Quantum Brief
--> Quantum Physics arXiv:2511.18198 (quant-ph) [Submitted on 22 Nov 2025] Title:Space-Optimized and Experimental Implementations of Regev's Quantum Factoring Algorithm Authors:Wentao Yang, Bao Yan, Muxi Zheng, Quanfeng Lu, Shijie Wei, Gui-Lu Long View a PDF of the paper titled Space-Optimized and Experimental Implementations of Regev's Quantum Factoring Algorithm, by Wentao Yang and 5 other authors View PDF Abstract: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-dimensional variant reduces the circuit size through lattice-based post-processing, but introduces substantial space overhead and lacks practical implementations.
AI Audio Summary
0:00 / 0:00
Click to play
Regev's Quantum Factoring Algorithm Achieves Space Reduction Enabling Practical Implementation

Quantum Physics arXiv:2511.18198 (quant-ph) [Submitted on 22 Nov 2025] Title:Space-Optimized and Experimental Implementations of Regev's Quantum Factoring Algorithm Authors:Wentao Yang, Bao Yan, Muxi Zheng, Quanfeng Lu, Shijie Wei, Gui-Lu Long View a PDF of the paper titled Space-Optimized and Experimental Implementations of Regev's Quantum Factoring Algorithm, by Wentao Yang and 5 other authors View PDF Abstract: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-dimensional variant reduces the circuit size through lattice-based post-processing, but introduces substantial space overhead and lacks practical implementations. Here, we propose a qubit reuse method by intermediate-uncomputation that significantly reduces the space complexity of Regev's algorithm, inspired by reversible computing. Our basic strategy lowers the cost from \( O(n^{3/2}) \) to \( O(n^{5/4}) \), and refined strategies achieve \( O(n \log n) \)which is a space lower bound within this model. Simulations demonstrate the resulting time-space trade-offs and resource scaling. Moreover, we construct and compile quantum circuits that factor \( N = 35 \), verifying the effectiveness of our method through noisy simulations. A more simplified experimental circuit for Regev's algorithm is executed on a superconducting quantum computer, with lattice-based post-processing successfully retrieving the factors. These results advance the practical feasibility of Regev-style quantum factoring and provide guidance for future theoretical and experimental developments. Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2511.18198 [quant-ph] (or arXiv:2511.18198v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2511.18198 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Wentao Yang [view email] [v1] Sat, 22 Nov 2025 21:57:22 UTC (623 KB) Full-text links: Access Paper: View a PDF of the paper titled Space-Optimized and Experimental Implementations of Regev's Quantum Factoring Algorithm, by Wentao Yang and 5 other authorsView PDFTeX Source view license Current browse context: quant-ph new | recent | 2025-11 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

post-quantum-cryptography
quantum-algorithms
quantum-computing
quantum-hardware
quantum-investment
superconducting-qubits

Source Information

Source: Reddit r/QuantumComputing (RSS)

Discussion

0 professional contributions

Sign in to join this professional discussion.

Be the first to add a constructive contribution.