RSA cryptography can be broken quickly by quantum computers. There are other public/private key schemes that might avoid that problem, though none are widely used. Some of these rely on NP-complete problems instead of merely BQP problems like factoring.

Quantum cryptography, if correctly implemented, should be theoretically unbreakable, not merely "hard" to break -- much like a one-time pad.