How Shor's Algorithm Factors 314191
minutephysics
Go to http://www.dashlane.com/minutephysics to download Dashlane for free, and use offer code minutephysics for 10% off Dashlane Premium! Watch the main video: https://www.youtube.com/watch?v=lvTqbM5Dq4Q
Support MinutePhysics on Patreon! http://www.patreon.com/minutephysics
This video explains how Shor’s Algorithm factors the pseudoprime number 314191 into its prime factors using a quantum computer. The quantum computation relies on the number-theoretic analysis of the factoring problem via modular arithmetic mod N (where N is the number to be factored), and finding the order or period of a random coprime number mod N. The exponential speedup comes in part from the use of the quantum fast fourier transform which achieves interference among frequencies that are not related to the period (period-finding is the goal of the QFT FFT).
REFERENCES
RSA Numbers (sample large numbers to try factoring) ... https://www.youtube.com/watch?v=FRZQ-efABeQ
26387157 Bytes