702 citations · 789 across the 8 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
quant-ph2019★ 702 cited
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Craig Gidney, Martin Ekerå
We significantly reduce the cost of factoring integers and computing discrete logarithms in finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Ni…
cs.CR2019★ 2 cited
Revisiting Shor's quantum algorithm for computing general discrete logarithms
Martin Ekerå
We heuristically show that Shor's algorithm for computing general discrete logarithms achieves an expected success probability of approximately 60% to 82% in a single run when modi…