Answers are grounded in this paper and cite their sources.
We show that n -bit integers can be factorized by independently running a quantum circuit with \(Õ(n3/2)\) gates for \(√n+4\) times, and then using polynomial-time classical post-processing. The correctness of the algorithm relies on a certain number-theoretic conjecture. It is currently not clear if the algorithm can lead to improved physical implementations in practice.
No takes yet. Share an insight, caveat, or question.
Oded Regev (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: