So actually getting prime factors is not an easy task. And so why we rely on RSA and similar algorithms.
Now spend 5 minutes and read about:
a) Shor's algorithm: Wikipedia
b) IBM qubit experiments: Experimental realization of "Shor's quantum factoring algorithm using nuclear magnetic resonance"
And final part is comes from the google guys, who played with D-Wave processor. They have proved it is real thing and can compute: "What is the Computational Value of Finite Range Tunneling?"
In 2016 D-Wave have announced 2000-Qubit system and several sources says it is in fact 1k of qubits is good to deal with RSA.
Now spend 5 minutes and read about:
a) Shor's algorithm: Wikipedia
b) IBM qubit experiments: Experimental realization of "Shor's quantum factoring algorithm using nuclear magnetic resonance"
And final part is comes from the google guys, who played with D-Wave processor. They have proved it is real thing and can compute: "What is the Computational Value of Finite Range Tunneling?"
In 2016 D-Wave have announced 2000-Qubit system and several sources says it is in fact 1k of qubits is good to deal with RSA.
