Shor’s algorithm and quantum patents explained

Shor’s algorithm lets a quantum computer factor large numbers much faster than regular computers can, threatening RSA encryption. But the way it achieves this—by running a set of mathematical steps on quantum hardware—means the method itself probably can’t be patented, unless you invent a new twist to the quantum computer itself. Patents on pure algorithms, even quantum ones, usually don’t hold up in court.

• Shor’s algorithm factors numbers exponentially faster than classical methods
• It poses a direct risk to RSA public-key encryption
• Patent protection for the algorithm itself is likely to be rejected
• Mathematical methods are rarely patent-eligible without hardware improvements