Quantum Applications Without the Hype
Where quantum computing actually helps: a use-case evaluation framework, chemistry, optimization, machine learning, cryptanalysis and post-quantum migration, QKD, and networking — each claim classified by evidence, never by press release.
Run every quantum claim through a five-question filter: is the speedup proved or heuristic, what does loading your data cost, what does each oracle call cost, does the error budget survive the circuit, and is the classical baseline standing still? Most advertised quantum advantages fail at least one of these questions once you do the end-to-end arithmetic, and this chapter shows you how to do that arithmetic yourself.
Simulating quantum systems such as molecules is the application quantum computers were born for: the memory a classical computer needs grows exponentially with system size, while a quantum computer's does not. Small molecules have been demonstrated on real hardware; classically hard chemistry has not, and this chapter shows exactly what a chemistry circuit measures and where today's honest frontier sits.
Quantum optimization encodes a cost function into qubit energies and uses interference to boost the probability of sampling low-cost answers; there is no proof it beats classical methods, and the evidence so far is heuristic. This chapter works one max-cut problem end to end by hand, runs a real QAOA circuit on it, and shows exactly what the quantum layer does and does not buy.
Quantum machine learning encodes data into qubit states and hopes a quantum model separates patterns that classical models cannot; no end-to-end advantage on classical data has ever been demonstrated, and data loading is the structural reason. This chapter works the three encoding schemes with real arithmetic and runs an angle-encoding circuit you can verify by hand.
The famous quantum advantage experiments did not solve a useful problem: they sampled bitstrings from a distribution that is expensive to simulate classically. That capability has one credible near-term product, certified randomness, and this chapter shows with a runnable circuit exactly what sampling from a quantum distribution means.
Shor's algorithm breaks today's public-key cryptography — RSA and elliptic curves — outright, because it exploits their hidden mathematical structure with an exponential speedup. Symmetric ciphers and hash functions largely survive: Grover's algorithm only halves their effective security bits, so AES-256 and SHA-256 remain safe. Both attacks are proved theory, but running them at cryptographic scale requires error-corrected machines far beyond any hardware that exists today.
Post-quantum cryptography (PQC) replaces RSA and elliptic-curve schemes with algorithms — now NIST-standardized as ML-KEM (FIPS 203) and ML-DSA (FIPS 204) — that run on ordinary classical hardware but resist known quantum attacks. Migration matters now because encrypted traffic recorded today can be decrypted later once a large quantum computer exists. This is the one quantum-driven action most engineering teams should take this year, and it requires zero quantum hardware.
Quantum key distribution (QKD) lets two parties grow a shared secret key over an optical link, with the guarantee that any eavesdropper measuring the photons unavoidably disturbs them and reveals herself as an elevated error rate. It works — commercial systems exist today at metropolitan distances — but it needs dedicated photonic hardware, is sharply distance-limited by fiber loss, and solves a narrower problem than post-quantum cryptography, which is why most traffic will use PQC instead.
A quantum network distributes entanglement — correlations between distant qubits stronger than any classical link can produce — enabling QKD without trusted nodes, distributed sensing, and eventually networked quantum computers. The core primitives (entanglement swapping, quantum memory, repeaters) are all physically demonstrated in laboratories, but no quantum repeater network operates in production anywhere: the quantum internet is honestly classified as lab-demonstrated, not practical today.
The road from today's noisy devices to fault-tolerant quantum computing is real but unscheduled: error correction is demonstrated at small scale, useful error-corrected computation is not. What you can take from this course is a permanent skill — an evaluation filter that separates proved theory, lab demonstrations, practical capability, and roadmap claims — plus the arithmetic habits to apply it to any headline without trusting anyone, including us.