Quick Navigation
Topics
Quantum Optimization
Quantum Machine Learning
An Efficient Quantum Factoring Algorithm
arXiv
Authors: Oded Regev
Year
2023
Paper ID
55854
Status
Preprint
Abstract Read
~2 min
Abstract Words
66
Citations
N/A
Abstract
We show that n-bit integers can be factorized by independently running a quantum circuit with {O}\(n3/2\) gates for sqrt{n}+4 times, and then using polynomial-time classical post-processing. The correctness of the algorithm relies on a number-theoretic heuristic assumption reminiscent of those used in subexponential classical factorization algorithms. It is currently not clear if the algorithm can lead to improved physical implementations in practice.
Why This Paper Matters
- This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
- It adds a 2023 reference point for readers tracking recent quantum research.
- We show that n-bit integers can be factorized by independently running a quantum circuit with O(n^3/2) gates for sqrtn+4 times, and then using polynomial-time classical...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.