Editing Quantum algorithm (section)

===Shor's algorithm===
{{main|Shor's algorithm}}

Shor's algorithm solves the [[discrete logarithm]] problem and the [[integer factorization]] problem in polynomial time,<ref>
{{cite journal
 | last = Shor | first = P. W.
 | year = 1997
 | title = Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
 | journal = [[SIAM Journal on Scientific and Statistical Computing]]
 | volume = 26 | issue = 5
 | pages = 1484–1509
 | arxiv = quant-ph/9508027
 | bibcode= 1995quant.ph..8027S
 | doi=10.1137/s0097539795293172
| s2cid = 2337707
 }}</ref> whereas the best known classical algorithms take super-polynomial time. It is unknown whether these problems are in [[P (complexity)|P]] or [[NP-complete]]. It is also one of the few quantum algorithms that solves a non-black-box problem in polynomial time, where the best known classical algorithms run in super-polynomial time.