6 ms·
Quantum computers are not generically good at all parallel problems. They have better asymptotic runtime for “brute force search” type problems, where you know
by lacker 7y ago
Quantum computers are not generically good at all parallel problems. They have better asymptotic runtime for “brute force search” type problems, where you know there is some answer but you have to guess-and-check repeatedly. Roughly they change a 2^n brute force algorithm to a 2^(n/2) algorithm in that case. The main area these problems are important is cryptography.
- asdfman123 7y agoSo what you're saying is I should short sell Bitcoin?
- insulanus 7y agoYou can read more about this issue here: https://en.bitcoin.it/wiki/Quantum_computing_and_Bitcoin https://en.bitcoin.it/wiki/Quantum_computing_and_Bitcoin
- henryw 7y agoThe article says "Attacking Bitcoin keys would require around 1500 qubits". So with 28 of these, Bitcoin is compromised?
- whaddawhat 7y agoNo, you need 1500 coherent qubits, in a single system.
- krzat 7y agoWould it be possible to evalute n randomly generated neural nets to find the best one?
- Arelius 7y agoMaybe in theory, but you'd at least have to fit the entire neural net into the width of the computer. So we'd need a maching with millions of qubits? That's a bit hard to fathom.
- deleted 7y ago[deleted]