Odd orders in Shor's factoring algorithm

DOI10.1007/S11128-014-0910-ZMaRDI QIDQ2018204zbMATH OpenOpenAlexFDO

Authors Thomas H. Lawson

Publication date 13 April 2015

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.2738

zbMATH Keywords

quantum algorithmsquantum computationShor's factoring algorithm

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Factorization; primality (11A51)

Abstract: Shor's factoring algorithm (SFA) finds the prime factors of a number, $N=p_1{p}_2$, exponentially faster than the best known classical algorithm. Responsible for the speed-up is a subroutine called the quantum order finding algorithm (QOFA) which calculates the order -- the smallest integer, $r$, satisfying $a^{r}modN=1$, where $a$ is a randomly chosen integer coprime to $N$ (meaning their greatest common divisor is one, $gcd(a,N)=1$). Given $r$, and with probability not less than $1/2$, the factors are given by $p_1=gcd(a^{fracr2}-1,N)$ and $p_2=gcd(a^{fracr2}+1,N)$. For odd $r$ it is assumed the factors cannot be found (since $a^{fracr2}$ is not generally integer) and the QOFA is relaunched with a different value of $a$. But a recent paper [E. Martin-Lopez: Nat Photon {�f 6}, 773 (2012)] noted that the factors can sometimes be found from odd orders if the coprime is square. This raises the question of improving SFA's success probability by considering odd orders. We show that an improvement is possible, though it is small. We present two techniques for retrieving the order from apparently useless runs of the QOFA: not discarding odd orders; and looking out for new order finding relations in the case of failure. In terms of efficiency, using our techniques is equivalent to avoiding square coprimes and disregarding odd orders, which is simpler in practice. Even still, our techniques may be useful in the near future, while demonstrations are restricted to factoring small numbers. The most convincing demonstrations of the QOFA are those that return a non-power-of-two order, making odd orders that lead to the factors attractive to experimentalists.

Recommendations

• Improving the success probability for Shor's factorization algorithm
• On computing ord\(_{N}(2)\) and its application
• On completely factoring any integer efficiently in a single run of an order-finding algorithm
• A fine estimate of quantum factorization success probability
• Probability estimates for Shor's algorithm

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3460351 (Why is no real title available?)
• Constant-optimized quantum circuits for modular multiplication and exponentiation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Shor’s Quantum Factoring Algorithm on a Photonic Chip

Cited in

(5)

• Probability estimates for Shor's algorithm
• On computing ord\(_{N}(2)\) and its application
• Improving the success probability for Shor's factorization algorithm
• A fine estimate of quantum factorization success probability
• On completely factoring any integer efficiently in a single run of an order-finding algorithm

This page was built for publication: Odd orders in Shor's factoring algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018204)