3 ms·
Useful applications don’t exist. They surely will, at some point, but not yet. That’s why they aren’t provided as examples.
by dr_dshiv 4y ago
Useful applications don’t exist. They surely will, at some point, but not yet. That’s why they aren’t provided as examples.
- jtc42 4y agoThere are/seem to be very specific scientific applications, mostly around simulation of other systems whose hamiltonians map nicely to that of the computer. For almost everyone on the planet that isn’t very useful, but for that small handful it can be a game changer. … doesn’t contribute much here, but worth knowing! It’s exciting either way.
- amelius 4y agoProtein folding (computational chemistry), and breaking everyone's crypto.
- nabla9 4y ago> breaking everyone's crypto Symmetric encryption and hash functions with 256 bits are already quantum proof. Post-quantum algorithms are here in few years. Some of them are already in use in critical applications.
- t_mann 4y agoImportantly, Bitcoin and Ethereum are (inadvertently) almost quantum-proof (because the addresses are hashes of the public keys), just not quite (because the public keys still get exposed during transactions). But at least the latter should be fixable (because the community is quite used to changes to the protocol anyway).
- go_elmo 4y agoI have to object, while not many algorithms exists, one of the most famous ones, Grovers algorithm [0] is also one of the most general ones and quite powerful. It reduces search of 2^n items to about 2^(n/2) while using n q-bits. Thats just the square root of a classical algorithm. [0] https://en.wikipedia.org/wiki/Grover%27s_algorithm https://en.wikipedia.org/wiki/Grover%27s_algorithm
- latenightcoding 4y agoof course they exist, we just don't have QCs with enough logical qubits yet.