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 five questions. Is the speedup proven, or just hoped for? What does loading your data cost? What does each oracle call cost? Does the error budget survive the circuit? Is the classical baseline standing still? Most advertised quantum advantages fail at least one question once you do the full math. This chapter shows you how to do that math yourself.
Simulating quantum systems, like molecules, is the job quantum computers were born for. The memory a normal computer needs grows exponentially with the size of the system. A quantum computer's does not. Small molecules have been demonstrated on real hardware. Chemistry that is hard for normal computers has not. This chapter shows exactly what a chemistry circuit measures, and where today's honest frontier sits.
Quantum optimization turns a cost into qubit energies. Then it uses interference to make low-cost answers more likely to show up. There is no proof it beats normal methods, and the evidence so far is heuristic (it sometimes works, with no guarantee). This chapter works one max-cut problem fully by hand. It runs a real QAOA circuit on it. Then it shows exactly what the quantum part does and does not buy you.
Quantum machine learning puts data into qubit states. The hope is that a quantum model can find patterns that normal models can't. No full, start-to-finish advantage on normal (classical) data has ever been demonstrated. The main reason is the cost of loading the data. This chapter works through the three ways to encode data, with real arithmetic. Then it runs an angle-encoding circuit you can check by hand.
The famous quantum advantage experiments did not solve a useful problem. They drew random bitstrings from a pattern of odds that is very costly to copy on a normal computer. That ability has one believable near-term product: certified randomness. This chapter uses a circuit you can run to show exactly what "sampling" from a quantum pattern means.
Shor's algorithm breaks today's public-key cryptography — RSA and elliptic curves — completely. It uses their hidden math structure to get an exponential speedup. Symmetric ciphers and hash functions mostly survive. Grover's algorithm only halves their security bits, so AES-256 and SHA-256 stay safe. Both attacks are proven theory. But running them at real key sizes needs error-corrected machines far beyond any hardware that exists today.
Post-quantum cryptography (PQC) replaces RSA and elliptic-curve schemes with new algorithms. NIST has now standardized them as ML-KEM (FIPS 203) and ML-DSA (FIPS 204). They run on ordinary computers but resist known quantum attacks. Moving to them matters now, because encrypted traffic recorded today can be decrypted later, once a large quantum computer exists. This is the one quantum-driven step most engineering teams should take this year. It needs zero quantum hardware.
Quantum key distribution (QKD) lets two people build a shared secret key over a fiber-optic link. It comes with a guarantee. Anyone who measures the light particles (photons) on the way always disturbs them. That shows up as a higher error rate, which gives the spy away. QKD works, and commercial systems exist today at city distances. But it needs special light-based hardware, it is sharply limited by how far light can travel in fiber, and it solves a narrower problem than post-quantum cryptography. That is why most traffic will use PQC instead.
A quantum network shares entanglement: links between faraway qubits that are stronger than any normal connection can make. That makes possible QKD without trusted middle stations, spread-out sensing, and one day, networked quantum computers. The core building blocks — entanglement swapping, quantum memory, and repeaters — have all been shown in labs. But no quantum repeater network runs in real use anywhere. So the quantum internet is honestly labeled lab-demonstrated, not practical today.
The road from today's noisy devices to fault-tolerant quantum computing is real, but it has no timetable. Error correction is demonstrated at small scale. Useful error-corrected computing is not. What you take from this course is a lasting skill. It is a filter that sorts claims into proven theory, lab demonstrations, practical ability, and roadmap claims. You also have the arithmetic habits to apply it to any headline, without trusting anyone — including us.