Story perspectives

Google Quantum Leap Threatens RSA; China Shows Satellite QKD

7/16/2026

Summary

Story summary

Google’s Sycamore solved a task in 200 seconds that would take a computer 10,000 years.
Quantum computers need qubits kept colder than outer space because they decohere from heat.
If scaled, quantum computers could break RSA encryption, prompting a “harvest now, decrypt later” warning and granting power comparable to writing or nuclear technology, raising concerns.
Chinese researchers demonstrated satellite quantum key distribution in 2017, providing a method to detect eavesdropping.

History

Historical Context

In 1994, Peter Shor published an algorithm demonstrating that a quantum computer could factor large integers exponentially faster than classical machines, endangering RSA encryption. Shor’s proof, presented at the Institute for Quantum Computing, showed factoring a 15-digit number required only 100 quantum gates, versus billions of classical operations. Today, Google’s Sycamore processor, built by Google AI and collaborating with NASA, achieves a 200-second quantum supremacy task, echoing Shor’s warning about breaking RSA. Consequently, governments such as the United States, China, and the European Union are accelerating post-quantum cryptography standards to safeguard data against future quantum attacks.

1 of 2

Story summary

Google’s Sycamore solved a task in 200 seconds that would take a computer 10,000 years.
Quantum computers need qubits kept colder than outer space because they decohere from heat.
If scaled, quantum computers could break RSA encryption, prompting a “harvest now, decrypt later” warning and granting power comparable to writing or nuclear technology, raising concerns.
Chinese researchers demonstrated satellite quantum key distribution in 2017, providing a method to detect eavesdropping.

1 / 2