Shor's algorithm can be used to break elliptic curve cryptography by computing discrete logarithms on a hypothetical quantum computer. The latest quantum resource estimates for breaking a curve with a 256-bit modulus (128-bit security level) are 2330 qubits and 126 billion Toffoli gates.
Link to resource?
https://en.wikipedia.org/wiki/Elliptic-curve_cryptographylook for Quantum computing attacks in the end