REVIEW 3 cited by
An Efficient Quantum Factoring Algorithm
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We show that $n$-bit integers can be factorized by independently running a quantum circuit with $\tilde{O}(n^{3/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.
Forward citations
Cited by 3 Pith papers
-
Implementation and Analysis of Regev's Quantum Factorization Algorithm
A new implementation of Regev's quantum factoring algorithm runs slower than Shor's on small numbers and only beats Shor's effectiveness for selected inputs after per-number parameter tuning.
-
Introducing the Quantum Economic Advantage Online Calculator
An open-access web calculator forecasts when quantum computers will beat price-equivalent classical machines, and its robustness analysis shows Shor-style advantage dates are stable while Grover-style dates depend hea...
-
Strategic Plan for Neutral Atom Quantum Computation
If qubit-count growth (~1.8x/yr) and gate-error reduction (~0.62x/yr) continue, neutral-atom quantum computers could reach practical quantum advantage within a decade, this roadmap projects.
Discussion (0). Continue with ORCID to comment.