We generalize our earlier works on computing short discrete logarithms with tradeoffs, and
bridge them with Seifert's work on computing orders with tradeoffs, and with Shor's …

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 …

This thesis contains a collection of efficient quantum algorithms and classical pre-and post-
processing algorithms for various number-and grouptheoretical problems with concrete …