After Q-Day: Quantum Applications at Scale • Matthew Keesan • YOW! 2025
Matthew Keesan from IonQ discusses the imminent arrival of "Q-Day"—the moment quantum computers will break current public-key encryption. He explains the fundamentals of quantum computing, including superposition and entanglement, details the hardware roadmap that places this threat within the decade, and explores the promising applications of this new computing paradigm in AI, drug discovery, and materials science, issuing a call to action for software engineers to get involved.
The Dawn of the Quantum Era and the Arrival of Q-Day
The quantum computing industry has defined “Q-Day” as the moment when quantum computers become capable of breaking the most common public-key encryption schemes, such as RSA and Elliptic Curve Cryptography (ECC). This event, driven by the power of Shor’s algorithm, is expected to occur by the end of this decade. The urgency is underscored by the “store now, decrypt later” threat, where adversaries are already harvesting encrypted data with the intent of decrypting it once a powerful enough quantum computer is available.
The Australian Signals Directorate (ASD) advises organizations to have a transition plan for post-quantum cryptography in place by 2026 and to complete the transition by 2030. This is not a distant threat; it necessitates immediate action.
Fundamentals of Quantum Computing
Unlike classical computers that use bits representing either a 0 or a 1, quantum computers use qubits. A qubit can exist in a superposition of both 0 and 1 simultaneously. This state can be visualized as a vector on the surface of a sphere, not just pointing up or down. These states are described by complex numbers called amplitudes, which govern the probability of measuring a 0 or a 1. Quantum mechanics, in this context, can be seen as an alternative probability system based on a different vector norm where outcomes still sum to one.
The second key principle is entanglement. When qubits are entangled, their fates are linked. The state of a multi-qubit system is not described by individual spheres but by a single state vector in a much higher-dimensional space (a hypersphere). Crucially, every time a qubit is added, the dimensionality of this state space doubles. This exponential growth is the source of a quantum computer’s power.
To illustrate this scaling, consider simulating the caffeine molecule, which has about 100 electrons. A classical simulation would require a state space on the order of 2^200, necessitating a computer larger than the moon. Nature, however, performs this “computation” effortlessly. This observation, first noted by Richard Feynman, is the foundational inspiration for building quantum computers: to simulate nature, we should use a computer built on the same quantum principles.
The Roadmap to Breaking Encryption
Progress in quantum computing follows the Dowling-Neven Law, which posits that quantum computing power increases doubly exponentially. Six years ago, a state-of-the-art 11-qubit machine could be simulated on a smartphone. Today’s 64-qubit systems require an exabyte of RAM to simulate classically, showcasing a computational power increase of nine quadrillion times.
However, today’s physical qubits are noisy. To perform useful computations, we need quantum error correction, which groups multiple physical qubits to create a single, more reliable logical qubit. Current research suggests a ratio of around 13 physical qubits to one logical qubit. To break 256-bit ECC, it’s estimated we’ll need around 20,000 physical qubits. Industry roadmaps from manufacturers project reaching this milestone by 2028, with plans for hundreds of thousands and even millions of qubits by 2030. This scaling is expected to be achieved by first tiling thousands of qubits onto single chips and then connecting these chips via photonic links, similar to the evolution from single-core to multi-core to clustered classical computing.
Solutions for a Post-Quantum World
There are two primary paths to secure communications in the quantum era:
- Post-Quantum Cryptography (PQC): This is a software-based solution involving new cryptographic algorithms believed to be resistant to attack by both classical and quantum computers. NIST has been standardizing several of these algorithms. The main drawback is that their security is based on computational difficulty, and there’s no guarantee a new quantum algorithm won’t be discovered to break them.
- Quantum Key Distribution (QKD): This is a hardware-based solution that uses a dedicated quantum channel to exchange cryptographic keys. Its security is guaranteed by the laws of physics. The “no-cloning theorem” prevents an eavesdropper from copying a key in transit, and any attempt to measure the key would collapse its quantum state, immediately alerting the parties to a man-in-the-middle attack. This technology is already being demonstrated, with CSIRO recently establishing a 13km QKD link in Sydney.
Programming and Applications Beyond Cryptography
Programming a quantum computer today is done at a very low level, akin to designing logic circuits. Developers use languages like Qiskit to arrange a sequence of universal quantum gates—such as the Hadamard gate for superposition, the CNOT gate for entanglement, and the T-gate for phase shifts—to manipulate qubits. Because the process is probabilistic, a program is run many times (“shots”) to build a histogram of results.
The complexity class for problems efficiently solvable by a quantum computer is BQP (Bounded-error Quantum Polynomial time). While it’s proven that quantum computers provide at most an exponential advantage over classical ones, this is transformative for certain problem classes. The focus is shifting from theoretical research to building real-world applications.
- Quantum AI: With the energy consumption of classical AI training becoming a major concern, the power efficiency of quantum computers (a 64-qubit system uses ~10kW) is highly attractive. Hybrid quantum-classical models are showing promise for accelerating tasks like LLM fine-tuning, with quantum methods already outperforming classical benchmarks on a small scale.
- Chemistry & Materials Science: Quantum computers can directly simulate molecular interactions, a task that is intractable for classical computers. This could revolutionize drug development by drastically shortening the discovery pipeline and enable the design of new catalysts for industrial processes like the Haber-Bosch process for fertilizer, which currently consumes over 2% of the world’s energy.
- Modeling & Simulation: Quantum algorithms can accelerate complex simulations in fields like computational fluid dynamics (e.g., modeling blood flow) and industrial engineering (e.g., crash simulations), offering significant savings in time and energy.
A Call to Action for Software Engineers
The field of quantum computing is at an inflection point, moving from a domain of physicists and PhDs to one that requires the expertise of software engineers. The current state of quantum software is comparable to classical computing in the 1970s, with immense opportunities to build the tools, libraries, and applications that will define the future. The community needs developers to turn research prototypes into production-grade software.
For those interested in getting involved, resources like Scott Aaronson’s book Quantum Computing Since Democritus provide a computer science-oriented introduction. Open source initiatives like the Munich Quantum Software Stack and non-profits like the Unitary Foundation offer avenues to contribute to building the quantum ecosystem. Just as the creators of the ENIAC could not have imagined today’s applications, we are at the beginning of a new computing revolution, and developers have a critical role to play in shaping it.