3 ms·
Google's new quantum supremacy device has 1,113 single-qubit gates and 430 two-qubit gates. Article "How to factor 2048 bit RSA integers in 8 hours using 20 mi
by nabla9 7y ago
Google's new quantum supremacy device has 1,113 single-qubit gates and
430 two-qubit gates.
Article "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 shows how to significantly
reduce the cost of factoring integers and computing discrete
logarithms. Implementation of the efficient device mentioned in the article
requires 2.7 billion Toffoli gates for 2048 bit input. It could factor
one key in 8 hours.
Microprocessors reached that high MOS transistor count less than 10 years ago. For example, 8-core Core i7 Haswell-E has 2.6 billion transistors (2014). If quantum computers follow Moore's law like conventional IC, it will take 40-years before
they can factor 2048 bit RSA.
- archgoon 7y ago> Microprocessors reached that high MOS transistor count less than 10 years ago. Note however that quantum computers can potentially benefit from existing lithography processes, so it may not take as long to scale up as we have already developed processes for very small highly integrated circuits.
- adtac 7y agoWe don't need quantum computers to be at microprocessor scale to make 2048-bit RSA factoring groundbreaking. If a quantum computer the size of a car can do it in 8 hours, it's sufficient.
- nabla9 7y agoIt's extremely hard to maintain car sized superposition for 8 hours. The devise itself can be huge, mostly because it's cooled, but the actual quantum state inside is just tiny chip.