4 ms·
This is a good question, and currently the answer is no. Quantum computers can only run very short, simple algorithms right now, because the qubits they're buil
by qnleigh 7mo ago
This is a good question, and currently the answer is no. Quantum computers can only run very short, simple algorithms right now, because the qubits they're built out of are noisy. You need a lot of error correction, which the community is working on.
The thing is, unlike ordinary computers, quantum computers can factor numbers about as easily as they can multiply them. So as soon as they can multiply two large integers, they'll also be able to factor the result and break RSA encryption based on keys of that size.
This blog post gives a good sense of the state of the art and what progress might look like:
Why haven't quantum computers factored 21 yet? https://algassert.com/post/2500 https://algassert.com/post/2500
- Foobar8568 7mo agoAnd isn't the response already known in the validation process?
- qnleigh 7mo agoI don't understand your question. Can you elaborate?
- Foobar8568 7mo agoReplication of quantum factorisation records with a 8bits home computer, Abacus and a dog
- nlarew 7mo agoWhat are you trying to say here? This makes no sense.
- Foobar8568 7mo agoThat's a famous paper that debunk a lot of things related to marketing announcements. Basically nothing has truly factorized 15, let alone 21.