@sun @lain @georgia Yes you can break RSA, and basically any cryptographic algorithm based on the exponential behavior of factorizing large prime numbers, with quantum computers. Technically. Not yet in reality.
The current research is mostly theoretical and the current record that could break RSA is a 50-bit integer I think. It's still years if not a decade or more until it becomes feasible at a larger scale. Still a threat right now though, if you care about data retention for feature breaking.
AES fairs much better and the last time I checked ~2 years ago the best theoretical algorithm halved the effective key size.