John Martinis, winner of 2025 Nobel Prize in Physics: I wouldn't want quantum computing to be known for breaking the internet'

"Back in 1994, Peter Shor, a mathematician at the Massachusetts Institute of Technology (MIT), demonstrated that a quantum computer could efficiently solve the factorization problem. This prediction is now beginning to materialize. By the end of this decade, a cryptographically relevant quantum computer will be able to break the encryption that underpins our global economy, warns Anand Oswal, executive vice president of Palo Alto Networks."

"For Oswal, the current cryptographic model has been for half a century the invisible shield that protects everything because it safeguards digital communication and stored data, the pillars of the internet. But Shor's prophecy is beginning to materialize with the advancement of quantum computing. It's at that tipping point: it's no longer in the labs, it's no longer a scientific project."

"Arora believes there is a window of opportunity of between two and seven years to address the challenge, but urges preparing now: This is the time to start thinking about how it will impact us and what implications it entails."

Digital security relies on cryptographic keys whose strength depends on factorization complexity. In 1994, mathematician Peter Shor proved quantum computers could efficiently solve factorization problems. This theoretical prediction is materializing as quantum computing advances beyond laboratory stages. Experts warn that by decade's end, cryptographically relevant quantum computers will break existing encryption protecting banking, messaging, cryptocurrency, and critical infrastructure. Cybersecurity leaders emphasize a narrow window of two to seven years exists to implement quantum-safe solutions. Organizations must begin transitioning to post-quantum cryptography immediately to safeguard digital communication and stored data that underpin the global economy.

Read at english.elpais.com