DeepAI AI Chat
Log In Sign Up

On the success probability of quantum order finding

by   Martin Ekerå, et al.

We prove a lower bound on the probability of Shor's order-finding algorithm successfully recovering the order r in a single run. The bound implies that by performing two limited searches in the classical post-processing part of the algorithm, a high success probability can be guaranteed, for any r, without re-running the quantum part or increasing the exponent length compared to Shor. Asymptotically, in the limit as r tends to infinity, the probability of successfully recovering r in a single run tends to one. Already for moderate r, a high success probability exceeding e.g. 1 - 10^-4 can be guaranteed. As corollaries, we prove analogous results for the probability of completely factoring any integer N in a single run of the order-finding algorithm.


page 1

page 2

page 3

page 4


On completely factoring any integer efficiently in a single run of an order finding algorithm

We show that given the order of a single element selected uniformly at r...

Revisiting Shor's quantum algorithm for computing general discrete logarithms

We heuristically demonstrate that Shor's algorithm for computing general...

Incentivizing Hidden Types in Secretary Problem

We study a game between N job applicants who incur a cost c (relative to...

No-go for quantum seals

We introduce the concept of a quantum "seal" and investigate its feasibi...

The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers

The discrete logarithm problem (DLP) is the basis for several cryptograp...

Robust quantum minimum finding with an application to hypothesis selection

We consider the problem of finding the minimum element in a list of leng...