I've been wondering how Quantum Computing can break elliptic curve cryptography. Are they good at breaking discrete log problems? I guess the idea would be that it can find the private key based on the public key(s)? 

 Pathetic 5 qubit attempt to load 256 bits of entropy