Content deleted Content added
→Prime Factorization: I added to the Prime factorization section explaining that there are no polynomially bounded classical algorithms for prime factorization but there are polynomially bounded quantum algorithms for prime factorization. I also used source 2 as an in text citation for this. |
m →Prime Factorization: I added a note that this section needs more work. |
||
Line 22:
== Prime Factorization ==
[[Prime Factorization|Prime factorization]] is believed to be a hard problem in classical computing. There is no known algorithm which can factor any integer into its prime factors in polynomial time with a classical computing. However, there are polynomially bounded quantum algorithms which can find the prime factorization of any integer.<ref name=":1" />
This section needs more work
== References ==
| |||