REVIEW 5 cited by
Fast versions of Shor's 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
Signed reviews
read the original 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.
Forward citations
Cited by 5 Pith papers
-
Approximate Quantum Fourier Transform in Logarithmic Depth on a Line
The approximate quantum Fourier transform can be implemented in logarithmic depth on a line with 4n qubits (or 2n for uniformly distributed inputs), improving on the previous 8n-qubit all-to-all construction.
-
Magic states are rarely the best resource to optimize: An analytical tool for qubit resource estimation in concatenated codes
A closed-form resource estimation tool for concatenated quantum error correction reveals that magic-state operations rarely dominate qubit costs, with general optimizations providing orders-of-magnitude larger reducti...
-
Thermodynamic limitations on fault-tolerant quantum computing
Landauer heating from quantum error correction creates a phase transition between stable and runaway error rates, and current superconducting qubit parameters for Shor's 2048-bit factoring sit in the stable phase.
-
Quantum oracles for the finite element method
Quantum oracles for finite element matrices can be built from fixed-point adders, multipliers, polynomial evaluation, and Newton-Raphson square roots with polylogarithmic cost in matrix size.
-
Quantum Arithmetic Circuits in Public-Key Cryptography
A structured survey of optimized quantum adders, multipliers, modular exponentiation and point-addition circuits for public-key cryptanalysis, plus fault-tolerant resource estimation techniques.
Discussion (0). Continue with ORCID to comment.