6 ms·
I reckon one that has quantum error correction on qubits which present Boolean values. I.e. one which could also run a classical program. That is the quantum co
by 317070 7y ago
I reckon one that has quantum error correction on qubits which present Boolean values. I.e. one which could also run a classical program.
That is the quantum computer which is actually a quantum Turing machine and which can do speedups of e.g. factorization. Unfortunately, it is hypothesized that such a quantum Turing machine will require about ~1000 qubits of this machine per qubit with error correction, maybe more.
- kulahan 7y agoFor what it's worth, the FAQ on his blog dances around this topic: "Running Shor’s algorithm to break the RSA cryptosystem would require several thousand logical qubits. With known error-correction methods, that could easily translate into millions of physical qubits, and those probably of a higher quality than any that exist today."
- grubles 7y ago"How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits" https://arxiv.org/abs/1905.09749 https://arxiv.org/abs/1905.09749