702 citations · 789 across the 8 of their papers we have counts for
Showing quant-phShow all
3 papers · 1 filter
quant-ph2022★ 4 cited
On the success probability of quantum order finding
Martin Ekerå
We prove a lower bound on the probability of Shor's order-finding algorithm successfully recovering the order in a single run. The bound implies that by performing two limited…
quant-ph2020★ 1 cited
On completely factoring any integer efficiently in a single run of an order finding algorithm
Martin Ekerå
We show that given the order of a single element selected uniformly at random from , we can with very high probability, and for any integer , efficiently find the…
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…