Deep Dive Series
Quantum Computing for Cybersecurity Professionals
Every introduction to quantum computing I could find was written for someone else. Physics students get the linear algebra. General readers get the cat, the maze, and a qubit that “tries every answer at once.” And the people who actually need this material, the security professionals asked to assess the threat, brief the board, and plan the migration, get a choice between myths and prerequisites.
This Deep Dive series is the introduction I wanted to hand my own mentees: quantum computing built from the ground up for cybersecurity professionals, under a standing contract. No lies-to-children, so nothing you learn here needs to be unlearned later. Every analogy carries a note on where it breaks. Claims you want to verify come with optional arithmetic (never harder than working out a subnet mask). Parts 2 through 7 build the machine’s logic, from probabilistic bits to the shape of a quantum algorithm. Parts 8 and 9 cash it out against cryptography, where Shor’s algorithm breaks RSA and elliptic curves while AES shrugs. Parts 10 and 11 cover the hardware reality and how to read vendor roadmaps like a professional. Start with Part 1 below, or jump anywhere. Every part stands alone.
Free Ebook · No Email Required
The complete series as a free ebook
All eleven parts below are also available as a single typeset PDF: 114 pages, the five box types in color, and a glossary of every term the series uses. Download it for offline reading, print it, or pass it to a colleague. The posts below and the ebook are the same text, and both are updated as the field moves.
PDF · 114 pages · 2.7 MB · Version 1.0, July 2026
-
Quantum Computing for Cybersecurity Professionals
Part 1: What a Quantum Computer Is Not
The popular story of quantum computing gets the professionally important details backwards. Part 1 clears the category error, previews the cryptographic casualty list, and sets your real deadline, which arrives well before Q-Day.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 2: The Classical Bit You Don’t Know Yet
Part 2 formalizes the classical bit: a definite value, probabilities that measure your ignorance, and a two-line proof that recordless mixing never un-mixes. Every belief here is true. One of them is about to matter.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 3: Quantum Amplitudes: The One New Rule
Part 3 adds the only new rule in quantum mechanics: uncertainty described by numbers that can be negative. Amplitudes, the Born rule, an honest definition of superposition, and a minus sign no single measurement can see.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 4: The Impossible Coin
The keystone of the series: a two-stage device returns certainty from a perfect fair coin, classical probability proves that impossible, and four lines of arithmetic show the amplitudes colliding. Part 2's receipt comes due.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 5: Vast State, Narrow Door
Part 5 scales to many qubits: 2^n amplitudes of workspace behind a single n-bit measurement. Holevo's bound, the no-cloning theorem, a failed copier that entangles instead, and the long-awaited autopsy of "tries every answer at once."
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 6: Correlations Without a Mechanism
Part 6 defines entanglement with four amplitudes and a factorization test, grants the gloves objection its full due, then breaks it with Bell's arithmetic: a shared recipe scores one-third, the qubits score one-quarter. Nothing communicates.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 7: The Shape of a Quantum Algorithm
Part 7 assembles the toolbox into the only recipe that works: prepare, imprint, interfere, measure. Deutsch's one-qubit algorithm runs the whole shape by hand, and the closing transform explains why structure is the entry fee.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 8: Shor: Cryptanalysis by Physics
Part 8 aims the four-move template at RSA: factoring becomes period-finding, the quantum Fourier transform reads the period through interference, and the same move takes down ECC and Diffie-Hellman. Plus the honest 2025 resource math.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 9: Grover and the Honest Speedup
Part 9 covers the algorithm that attacks everything Shor cannot. Grover's quadratic speedup is real, provably optimal, and far weaker in practice than the halving figure suggests, for a reason NIST wrote into its own standards.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 10: The Machine Itself
Part 10 builds the machine every earlier part assumed. Decoherence is the environment measuring your qubits uninvited, error correction checks integrity without reading the data, and the number in the headline is almost never the number that matters.
Read More » -
Quantum Computing for Cybersecurity Professionals
Part 11: Reading the Field Like a Professional
The series closes by turning ten parts of physics into working equipment: how resource estimates move, which milestones matter, the standing answers to the questions you will be asked, and the deadline that was never Q-Day.
Read More »