Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
1–10 of 146 posts
Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#2Just to be clear such a machine has not yet been built. This is only a theoretical paper at the moment.
Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#3Just to be clear such a machine has not yet been built. This is only a theoretical paper at the moment.
Yeah, I was thinking "Waaait, aren't they at <100 qubits still?"
Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#4Besides the number of qbits, is "multimode memory" real or hypothetical?
Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#5Just to be clear such a machine has not yet been built. This is only a theoretical paper at the moment.
Do I understand correctly, that largest quantum computer that exists today contains less than 100 qubits?
Also it does not seem that there's an exponential grow in this area: https://www.statista.com/statistics/993634/quantum-computers....
They hit the wall in 2017.
We should be safe for now :)
Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#6Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#7Just to be clear such a machine has not yet been built. This is only a theoretical paper at the moment.
Do I understand correctly, that largest quantum computer that exists today contains less than 100 qubits? Also it does not seem that there's an exponential grow in this area: https://www.statista.com/statistics/993634/quantum-computers... . They hit the wall in 2017. We should be safe for now :)
IBM has 1000 qubits on their roadmap by 2023 [1]. I'm interested to see how that goes, and what we can learn from it about scaling up these systems into the thousands of qubits.
Edit: for anyone interested in learning more about quantum computation, I have a list of resources on my website [2].
[1] https://www.ibm.com/blogs/research/2020/09/ibm-quantum-roadm...
Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#8Just to be clear such a machine has not yet been built. This is only a theoretical paper at the moment.
Do I understand correctly, that largest quantum computer that exists today contains less than 100 qubits? Also it does not seem that there's an exponential grow in this area: https://www.statista.com/statistics/993634/quantum-computers... . They hit the wall in 2017. We should be safe for now :)
And the error rate of 10^-3 seems problematic, as well.
Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#9Quantum computers of this scale are probably 5-15 years out. Basically this is a warning that if you have secrets that should still be kept secret over that timeframe, you should not be using RSA today.
Re: Factoring 2048 RSA integers in 177 days with 13436 qubits and a multimode memory
#10Just to be clear such a machine has not yet been built. This is only a theoretical paper at the moment.
Do I understand correctly, that largest quantum computer that exists today contains less than 100 qubits? Also it does not seem that there's an exponential grow in this area: https://www.statista.com/statistics/993634/quantum-computers... . They hit the wall in 2017. We should be safe for now :)
Those quantum computers can't execute Shor's algorithm, which is required to attack RSA. AFAIK the best relevant factoring result is still 21=3*7 from 2012.
There are claims of bigger factored numbers, but they exploited special cases (e.g. factors differing by only two bits) and have no hope of being extended to attack cryptography.
https://crypto.stackexchange.com/questions/59795/largest-int...
A 2019 paper manged to factor 21 on a 16 qubit ibmqx5, but failed to go up to 35:
> the algorithm fails to factor N=35. This is due to the cumulative errors coming from the increasing number of two-qubits gates necessary to implement the more complex MEF needed for this case