3 ms·
Are these quantum computers currently powerful enough to tackle things like breaking non-quantum proof encryption?
by cgb223 7y ago
Are these quantum computers currently powerful enough to tackle things like breaking non-quantum proof encryption?
- fhfhdhdbdjx 7y agoShort answer is no. Longer answer requires understanding quantum error correction and how long before we get quantum computers with 1000s of qubits.
- sampo 7y agoShort answer: no. Longer answer: currently no.
- HillRat 7y agoAs long as you don’t need to factor a prime greater than 4088459, absolutely. More seriously, my take is that a lot of the (modest) work on quantum algorithms in industry is to provide financial and some engineering and aerospace domains with potential “off the shelf” algorithms if and when quantum supremacy is achieved for those problems. Right now it’s more of an intellectual exercise, excepting some specific work that can take advantage of quantum annealing approaches.