Content deleted Content added
I developed the section on quantum circuits. Adding a point about how the universality of the set of quantum gates effects the complexity of circuits. I used source 2 as an in text citation for this. I also added a note that this section needs more work and clarification. |
→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. |
||
Line 21:
== 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" />
== References ==
| |||