# Engineer's Quantum Breakthrough Poses Both Promise and Peril
Craig Gidney, a quantum computing researcher at Google, stands at the center of one of technology's most consequential races: building quantum computers powerful enough to break the encryption that protects nearly all digital communication today.
Gidney's work focuses on quantum error correction, the engineering challenge that separates theoretical quantum computing from practical machines. His contributions to quantum circuits have made the prospect of cryptographically relevant quantum computers closer than many security experts anticipated. A quantum computer operating at sufficient scale could theoretically run Shor's algorithm, the mathematical procedure that would render current encryption standards obsolete.
The significance extends far beyond academic interest. Governments, financial institutions, and tech companies worldwide depend on RSA and elliptic curve encryption to secure everything from banking transactions to state secrets. A quantum computer capable of factoring large numbers quickly enough to break these codes would fundamentally compromise digital security infrastructure built over decades.
Gidney's engineering contributions address error correction, a primary obstacle preventing quantum computers from reaching that threshold. Quantum systems are fragile. Qubits lose their quantum properties through "decoherence" when exposed to heat, vibration, and electromagnetic interference. Error correction requires multiple physical qubits to encode single logical qubits, a massive overhead that demands engineering breakthroughs Gidney's research helps provide.
His work on surface codes and topological error correction has improved estimates of how many qubits a quantum computer would need to pose genuine cryptographic threats. Earlier estimates suggested millions of physical qubits. Gidney's more refined calculations show the threshold might be substantially lower, though still in the hundreds of thousands to millions range.
This gap between theoretical threat and engineering reality remains the only barrier protecting current encryption. Intelligence agencies recognize this timeline. The NSA has already recommended transitioning to post-quantum cryptography standards that resist quantum computer attacks. NIST finalized post-quantum cryptographic algorithms in 2022, but widespread adoption remains slow.
The race involves competing timelines. Gidney and others advancing quantum error correction push forward the date when quantum computers become cryptographically dangerous. Simultaneously, cybersecurity officials attempt to migrate critical infrastructure to quantum-resistant encryption before that day arrives. Adversaries, meanwhile, employ "harvest now, decrypt later" strategies, storing encrypted data today with the intention of decrypting it once quantum computers become available.
Gidney's work at Google represents one research trajectory, but quantum computing development occurs globally. IBM, startups like IonQ and Atom Computing, and government programs in China, the EU, and elsewhere pursue different physical approaches to quantum computing. Some paths may reach practical quantum computers faster or slower than others.
The paradox defines Gidney's position. His engineering innovations accelerate the development of quantum computers that could transform medicine, materials science, and optimization problems. Those same breakthroughs simultaneously accelerate the timeline for quantum computers to break digital security. Neither outcome is avoidable. The pace of cryptographic transition now matters immensely. Organizations that delay post-quantum encryption adoption face genuine risk that data encrypted today becomes vulnerable within years, not decades.