Researchers at Google and Swedens KTH Royal Institute of Technology have developed a more efficient technique for decryption calculations by quantum computers. The technique uses modular exponentiation, a mathematical process for finding the remainder when a number is raised to a certain power and divided by another number. Google’s Craig Gidney and KTH’s Martin Ekera demonstrated that a quantum system could crack 2,048-bit RSA encryption with just 20 million quantum bits, rather than requiring 1 billion qubits.”]