Fast versions of Shor's quantum factoring algorithm
Christof Zalka (T-6 LANL)
TL;DR
This paper introduces accelerated, parallelized versions of Shor's quantum factoring algorithm utilizing FFT-based multiplication, enabling the potential to factor extremely large numbers with future quantum computers.
Contribution
It presents novel, highly parallelized implementations of Shor's algorithm that significantly improve efficiency using FFT-based multiplication techniques.
Findings
Enables factoring of numbers with millions of digits on future quantum computers
Demonstrates the effectiveness of FFT-based multiplication in quantum algorithms
Provides a scalable approach to quantum factoring
Abstract
We present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer multiplication. The quick reader can just read the introduction and the ``Results'' section.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications