Shor's Algorithm
A Shor's Algorithm is a integer factorization algorithm that can be applied by a quantum computer.
- See: Quantum Algorithm, Integer Factorization, Prime Factor, Polynomial Time, Pseudo-Polynomial Time, Complexity Class, BQP, General Number Field Sieve, Sub-Exponential Time, Quantum Fourier Transform.
References
2014
- (Wikipedia, 2014) ⇒ http://en.wikipedia.org/wiki/Shor's_algorithm Retrieved:2014-10-14.
- Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer factorization formulated in 1994. Informally it solves the following problem: Given an integer N, find its prime factors.
On a quantum computer, to factor an integer N, Shor's algorithm runs in polynomial time (the time taken is polynomial in log N, which is the size of the input). [1] Specifically it takes time , demonstrating that the integer factorization problem can be efficiently solved on a quantum computer and is thus in the complexity class BQP. This is substantially faster than the most efficient known classical factoring algorithm, the general number field sieve, which works in sub-exponential time — about . [2] The efficiency of Shor's algorithm is due to the efficiency of the quantum Fourier transform, and modular exponentiation by repeated squarings. The factorization also needs huge numbers of quantum gates. It increases with N as (log N)3. [3] Thus factoring of a 4096-bit number requires 4,947,802,324,992 quantum gates. [4] If a quantum computer with a sufficient number of qubits could operate without succumbing to noise and other quantum decoherence phenomena, Shor's algorithm could be used to break public-key cryptography schemes such as the widely used RSA scheme. RSA is based on the assumption that factoring large numbers is computationally infeasible. So far as is known, this assumption is valid for classical (non-quantum) computers; no classical algorithm is known that can factor in polynomial time. However, Shor's algorithm shows that factoring is efficient on an ideal quantum computer, so it may be feasible to defeat RSA by constructing a large quantum computer. It was also a powerful motivator for the design and construction of quantum computers and for the study of new quantum computer algorithms. It has also facilitated research on new cryptosystems that are secure from quantum computers, collectively called post-quantum cryptography. In 2001, Shor's algorithm was demonstrated by a group at IBM, who factored 15 into 3 × 5, using an NMR implementation of a quantum computer with 7 qubits. However, some doubts have been raised as to whether IBM's experiment was a true demonstration of quantum computation, since no entanglement was observed. Since IBM's implementation, several other groups have implemented Shor's algorithm using photonic qubits, emphasizing that entanglement was observed. In 2012, the factorization of 15 was repeated. [5] Also in 2012, the factorization of 21 was achieved, setting the record for the largest number factored with a quantum computer. In April 2012, the factorization of 143 was achieved, although this used adiabatic quantum computation rather than Shor's algorithm. [1]
- Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer factorization formulated in 1994. Informally it solves the following problem: Given an integer N, find its prime factors.
- ↑ See also Pseudo-polynomial time.
- ↑ MathWorld: Number Field Sieve
- ↑ http://arxiv.org/abs/quant-ph/9602016 - Efficient Networks for Quantum Factoring
- ↑ https://www.schneier.com/blog/archives/2008/03/quantum_computi_1.html - Bruce Schneier: Quantum Computing: Hype vs. Reality
- ↑ http://arxiv.org/pdf/1202.5707v1.pdf - Computing prime factors with a Josephson phase qubit quantum processor
1993
- (Shor, 1993) ⇒ Peter W Shor. (1994). “Algorithms for quantum computation: discrete logarithms and factoring.” In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science.