Sunday, November 18, 2012

Section 19.3 and Blog Post, due November 19

The most difficult part of the reading was the explanation of the Quantum Fourier transform.

I had never thought about how superposition of states could be used as an effective tool in solving the problems of RSA (namely, factoring a large integer).  However, it is an idea that correctly applied has the potential to work.  Indeed, it has been shown that it can be solved provided a quantum computer.  So the big obstacle here will just be actually building one, which could be a huge obstacle.  Or maybe the government already has one and we just don't know it...

No comments:

Post a Comment