The complete field guide
Contents
Move from the physical meaning of information to algorithms, engineering, hardware, applications, and defensible technical judgment.
Download an offline edition
The EPUB 3 and print PDF are generated from the same 95 rendered chapters. The checksum file binds both downloads to this edition.
8 entries
Orientation Guides
Eight re-entry points for the concepts the rest of the book assumes.
00How to Use This BookHow to read Quantum Computing, End to End: the ten parts, chapter anatomy, and the study loop that turns reading into working knowledge.ReadGuideComputation, Information, and QubitsWhat a qubit actually is: amplitudes versus probabilities, a Hadamard interference calculation by hand, and reversibility as the bridge to quantum gates.ReadGuideAmplitudes, Measurement, and GatesThe one-qubit toolkit: normalize state vectors, apply X Z H and S gates as matrices, and watch interference and basis-dependent measurement in hand arithmetic.ReadGuideMulti-Qubit Circuits, Entanglement, and No-Hype ProtocolsTwo qubits change everything: tensor products, CNOT, a Bell state by hand, the separability test for entanglement, no-cloning, and protocols without hype.ReadGuideQuantum Algorithms and SpeedupsWhere quantum speedups come from: problem structure, phase kickback, Grover computed by hand, Shor as period finding, and why query counts are not runtimes.ReadGuideNoise, Error Correction, and Fault ToleranceWhy noise dominates quantum computing: T1 and T2, syndromes, surface codes and thresholds, decoders, and the proof gates of a fault-tolerance roadmap.ReadGuideHardware Architecture and the Full StackThe quantum stack from application to physical qubits, the metrics that outrank qubit count, and the strengths and bottlenecks of each hardware modality.ReadGuideApplications, Evidence, and StrategyHow to judge quantum application claims: an evidence ladder from narrative to customer ROI, worked chemistry and optimization examples, and a decision frame.Read
7 entries
Part I. Mental Model
Computation as a physical process: qubits, measurement, interference, and entanglement without the myths.
01Computation Is PhysicalWhy every quantum claim is really a claim about a physical system: state, control, noise, and measurement, and how to read qubit counts like an engineer.Read02Classical Information, Gates, Circuits, and ReversibilityClassical bits, gates, and circuits through the reversibility lens: why quantum operations must be invertible and how to embed AND without erasing information.Read03Probability vs AmplitudeWhy quantum amplitudes are not probabilities: signs, phases, the Born rule, and the one-gate example that shows what compression destroys.Read04Qubits Without MysticismA qubit explained without mysticism: one normalized state, one measurement rule, and the operational test that separates honest explanations from slogans.Read05Measurement and What It Does Not MeanWhat quantum measurement actually does: basis-dependent sampling that changes the state, why more shots do not fix a wrong circuit, and three myths to retire.Read06Interference as the Engine of Quantum AlgorithmsHow interference powers quantum algorithms: amplitudes combine before probabilities exist, shown in a three-gate circuit.Read07Entanglement Without Faster-Than-Light MythsEntanglement as non-factorable joint state: the Bell state built with two gates, why its correlations cannot carry messages, and what it is actually good for.Read
8 entries
Part II. Mathematical Core
The linear algebra quantum computing uses, introduced in the order the machinery needs it.
08Complex Numbers for Quantum ComputingComplex numbers as working tools for quantum computing: conjugate, magnitude, and phase, why the Born rule squares magnitudes, and which phase changes matter.Read09Vectors, Bases, and AmplitudesQuantum states as coordinate vectors: bases, ordering conventions, normalization, and the Born rule, with the three labels to write before every calculation.Read10Inner Products, Orthogonality, and ProjectionInner products, conjugate transpose, orthogonality, and projection: the arithmetic behind measurement probabilities and state updates.Read11Matrices as GatesMultiply Pauli and Hadamard matrices against state vectors by hand, and learn why unitarity is the contract every gate must keep.Read12Unitary Operations and ReversibilityWhy the condition U-dagger-U equals I decides which matrices can be quantum gates, and what reversibility costs classical subroutines.Read13Tensor Products and State-Space GrowthTensor products build multi-qubit states with 2^n amplitudes; learn the product rule and why that growth is not readable output.Read14Observables, Eigenvectors, and MeasurementObservables, eigenvalues, and expectation values: what a quantum measurement can return and what an average over shots means.Read15Density Matrices and Mixed StatesDensity matrices describe pure and mixed states, carry coherence in off-diagonal entries, and model what noise does to qubits.Read
7 entries
Part III. Circuit Model
Gates, controlled operations, Bell states, no-cloning, and the costs hidden by a circuit diagram.
16Circuit Notation as a Programming LanguageRead quantum circuit diagrams as ordered programs: wires, gates, controls, depth, width, measurement, and classical output.Read17One-Qubit Gates and the Bloch SphereOne-qubit gates as rotations on the Bloch sphere, global versus relative phase, and why the sequence HZH flips a bit.Read18Controlled Gates and Reversible Classical ComputationHow controlled gates make classical logic reversible: CNOT and Toffoli traced branch by branch, ancillas, and the compute-use-uncompute pattern.Read19Multi-Qubit CircuitsMulti-qubit circuits demand convention discipline: tensor-product expansions, gate scope, basis order, and why wire count says nothing about entanglement.Read20Bell States and GHZ StatesBuild Bell and GHZ states by hand with H and CNOT, predict their measurement statistics, and learn what an entanglement demo does and does not prove.Read21No-Cloning and Why Copying Breaks Quantum LogicThe no-cloning theorem proved from linearity in a few lines, which copying still works, and why the result shapes quantum software and error correction.Read22Circuit Cost: Depth, Width, Gate Set, ConnectivityA circuit's real cost is set by width, depth, gate set, connectivity, and measurement; learn the audit table that separates runnable circuits from drawings.Read
13 entries
Part IV. Protocols and Algorithms
Protocols and algorithms traced from mechanism to complexity claim and practical constraint.
23Bell Tests and Nonclassical CorrelationsWhat a Bell test actually rules out, why matching random bits are not enough, and why nonclassical correlation still cannot send a controllable message.Read24Superdense CodingSuperdense coding traced gate by gate: two classical bits from one transmitted qubit, paid for in advance with a shared Bell pair.Read25TeleportationQuantum teleportation as a protocol with a ledger: one Bell pair, two classical bits, a Bell measurement, and a correction that rebuilds the state.Read26Quantum Key DistributionHow quantum key distribution uses measurement disturbance to expose eavesdroppers, and how it differs from post-quantum cryptography.Read27Oracles and Query ComplexityOracle models and query complexity: counting quantum speedups honestly, the phase-kickback trick, and why the black box itself has a price.Read28Deutsch, Deutsch-Jozsa, and Bernstein-VaziraniDeutsch, Deutsch-Jozsa, and Bernstein-Vazirani: the teaching algorithms that turn global properties into phase patterns readable in one query.Read29Simon and Hidden StructureSimon's algorithm: a hidden xor promise turns quantum samples into linear equations, the template that leads to period finding and Shor.Read30Grover and Amplitude AmplificationGrover search as amplitude amplification: the quadratic speedup, the tuned iteration count, and the overshoot that punishes running too long.Read31Quantum Fourier TransformThe quantum Fourier transform as a basis change: roots of unity, phase progressions, and why the QFT reveals periodicity instead of creating speed.Read32Phase EstimationPhase estimation: counting qubits, controlled powers of a unitary, and the inverse QFT combine to read eigenphases at a chosen precision.Read33Shor as Period FindingShor's algorithm as period finding: the modular-exponentiation reduction, the phase-estimation engine, and the resources real keys demand.Read34Hamiltonian SimulationHamiltonian simulation as an engineering workload: time evolution, product formulas, and how to turn a molecule into an auditable resource estimate.Read35Variational Algorithms and Their LimitsVariational quantum algorithms as hybrid loops: ansatz, optimizer, shot costs, barren plateaus, and why the classical baseline decides.Read
9 entries
Part V. Practical Software
Simulation, SDKs, transpilation, noise, benchmarking, and reproducible computational work.
36Python and Quantum Programming WorkflowA reproducible Python workflow for quantum experiments: pinned environments, runnable tests, run records, and the line between stable ideas and drifting SDKs.Read37Building a Small Simulator From ScratchBuild a minimal statevector simulator in Python: normalization, unitary gates, basis ordering, Born-rule sampling, and the tests that catch wrong mental models.Read38Qiskit, Primitives, and Circuit ExecutionQiskit-style circuit execution: primitives, backends, shot counts and standard error, transpilation metadata, and the debugging ladder to hardware.Read39Cirq and Alternative ToolchainsComparing quantum SDKs by circuit model, simulator behavior, backend fit, API stability, and reproducibility rather than popularity.Read40Transpilation and Hardware-Aware CompilationHow transpilation rewrites circuits for real gate sets and topologies: routing overhead, compiled depth, error budgets, and checkable claims.Read41Noise Models and Noisy SimulationNoise models and noisy simulation: bit-flip and depolarizing channels, ideal-versus-noisy comparison, and diagnosing error patterns.Read42Benchmarking Quantum ProgramsHow to benchmark quantum programs honestly: baselines first, shot-noise arithmetic, explicit evidence labels, and artifacts anyone can rerun.Read43Resource Estimation for Fault-Tolerant AlgorithmsTurn a logical quantum workload into auditable physical-qubit and runtime estimates, with sensitivity analysis that exposes the dominant assumption.Read44Reproducible Quantum LabsPackage quantum experiments so anyone can rerun them: exact commands, seeds, expected outputs, shot statistics, failure modes, and honest limitations.Read
9 entries
Part VI. Reliability and Fault Tolerance
Decoherence, error correction, decoders, logical operations, and the overhead behind reliability.
45Decoherence and Error ChannelsDecoherence, bit-flip and depolarizing channels, and the coherence budget: how ideal circuits become noisy data and how to diagnose what went wrong.Read46Error Mitigation vs Error CorrectionError mitigation cleans estimates from noisy runs; error correction protects logical information. Learn the boundary and the evidence each side needs.Read47Stabilizers and Syndrome MeasurementSyndrome measurement reveals which error struck without reading the protected state, the measurement trick that makes quantum error correction possible.Read48Repetition, Bit-Flip, Phase-Flip, and Shor CodesTrace the three-qubit bit-flip and phase-flip codes and Shor nine-qubit code by hand, and learn exactly which errors each small code cannot fix.Read49Surface Codes and Threshold IntuitionSurface codes, code distance, and threshold intuition: why local checks dominate fault-tolerance roadmaps and what the overhead really costs.Read50LDPC, Bosonic, Cat, GKP, and Topological ApproachesHow to compare LDPC, bosonic, cat, GKP, and topological error-correction approaches by physical assumptions, overhead, evidence, and proof gates.Read51Decoders and Real-Time Classical ControlWhy fault tolerance needs real-time classical decoding: syndrome streams, latency budgets, Pauli frames, and control-stack bottlenecks.Read52Logical Qubits and Reliable OperationsHow to evaluate a logical-qubit claim: error suppression, operation set, lifetime, cycle depth, overhead, and relevance to a real workload.Read53Why Useful Quantum Computers Are Systems Engineering ProjectsUseful quantum computers are systems engineering projects: learn weakest-layer review, interface discipline, and roadmaps with kill criteria.Read
10 entries
Part VII. Hardware Architecture
The complete machine stack and the engineering tradeoffs among leading hardware modalities.
54The Full Quantum Computer StackTrace any quantum computation from problem to algorithm, circuit, compiler, control, qubits, readout, and decision, layer by layer.Read55Superconducting QubitsSuperconducting qubits for engineers: Josephson junctions, transmons, microwave gates, readout resonators, cryogenics, and scaling limits.Read56Trapped IonsTrapped-ion qubits for engineers: identical atomic qubits, laser-driven gates, chain connectivity, slow clocks, and modular scaling.Read57Neutral AtomsNeutral-atom qubits for engineers: tweezer arrays, Rydberg blockade gates, reconfiguration, atom loss, and logical-scale questions.Read58PhotonicsPhotons are ideal carriers of quantum information and awkward computers. Learn to judge photonics claims by role, loss budget, and proof gates.Read59Silicon Spin QubitsSilicon spin qubits use semiconductor manufacturing to scale quantum hardware. Learn where the analogy holds, where variability bites, and what proof to demand.Read60Cat Qubits and Bosonic EncodingsCat qubits encode quantum information in oscillator states to bias noise. Learn to test overhead promises against gates, readout, and matched baselines.Read61Topological Qubits and Evidence StandardsTopological qubits promise self-protecting hardware at a high evidentiary price. Learn to grade claims with evidence labels, proof gates, and kill criteria.Read62Cryogenics, Control, Packaging, and ManufacturingCryogenics, wiring, packaging, and yield set the real scaling path for quantum hardware. Learn to audit the infrastructure stack behind any qubit roadmap.Read63Quantum-Centric Supercomputing and Hybrid WorkflowsHybrid quantum-classical workflows are loops, not magic. Learn to evaluate partitioning, latency, data movement, and the classical baseline they must beat.Read
9 entries
Part VIII. Applications and Strategy
Applications evaluated against buyers, classical baselines, evidence levels, and decision gates.
64What Makes a Problem Quantum-Suitable?A problem is quantum-suitable only when structure, baseline, hardware, and workflow economics line up. Learn the screen to apply before any pilot.Read65Quantum Simulation and ChemistryChemistry is quantum computing's most natural application and still a hard business case. Learn to read encodings, resource estimates, and classical baselines.Read66Materials, Energy, and Industrial ScienceHow to judge quantum opportunities in materials, energy, and industrial science: name the property, the workflow, the baseline, and the resource gap.Read67Optimization: Where Caution Is RequiredWhy quantum optimization claims demand caution: strong classical heuristics, encoding costs, sampling noise, and the benchmark hygiene that decides who wins.Read68Cryptography, PQC, QKD, and Security MigrationHow to plan quantum security response: separate Shor risk, PQC migration, and QKD infrastructure, then sequence the work by asset lifetime.Read69Quantum Machine Learning and Benchmark DisciplineA checklist for quantum machine learning claims: data encoding cost, tuned classical baselines, trainability, noise, and what expectation values measure.Read70Sensing, Navigation, and Adjacent Quantum TechnologiesQuantum sensing, timing, and navigation are not quantum computing, and that is the opportunity: different buyers, timelines, and evidence to diligence.Read71Application Evidence LevelsA labeling system for quantum application claims, from theory and simulation to pilots and production, so each kind of evidence gets the right weight.Read72When to Build, Partner, Wait, or AvoidA decision framework for quantum opportunities: when to build, partner, invest, monitor, wait, or avoid, and the proof gates that move you between labels.Read
10 entries
Part IX. Company and Investing
A diligence system for roadmaps, moats, markets, incentives, and the strength of company evidence.
73The Quantum Company LandscapeHow to map quantum companies by layer, from hardware to security, and assign each category the proof gate its claims must actually pass.Read74Hardware Modality DiligenceHow to compare quantum hardware companies across modalities with proof gates, kill criteria, and a matrix that separates physics bets from execution bets.Read75Software and Developer-Platform DiligenceHow to diligence a quantum software or developer-platform company: workflow ownership, switching costs, hardware dependence, and proof of value.Read76Error-Correction-Stack DiligenceHow to diligence an error-correction-stack company: decoders, controls, logical qubits, and whether the bottleneck it owns is measurable.Read77Application-Company DiligenceHow to diligence a quantum application company: buyer, classical baseline, data access, quantum resource assumptions, and timing.Read78Supply-Chain and Infrastructure DiligenceHow to diligence quantum supply-chain and infrastructure companies, from cryogenics and control electronics to packaging and calibration.Read79Market Timing and Wedge SelectionHow to choose a quantum startup wedge: match technical readiness, customer urgency, capital intensity, and timing before the market exists.Read80Moats, Partnerships, and StandardsHow to tell a durable quantum company moat from press and partnerships, and what standards participation actually proves.Read81Reading Roadmaps Like an OperatorHow to read a quantum company roadmap like an operator: translate milestones into metrics, dependencies, proof gates, and watch items.Read82Investment Memo and Startup Thesis TemplatesTemplates for quantum investment memos and startup theses that tie decisions to source-labeled evidence, proof gates, kill criteria, and named alternatives.Read
5 entries
Part X. Capstones
Five public artifacts that force the technical and decision layers into inspectable work.
83Full-Stack Algorithm TraceTrace one quantum algorithm from problem and math through circuit, code, noise, and hardware to a resource estimate and a decision a reviewer can inspect.Read84Hardware-Constrained LabBuild a lab that compares an ideal quantum circuit with its hardware-constrained version across connectivity, native gates, noise, and timing budgets.Read85Application Evidence DossierAssemble a quantum application evidence dossier that starts from the buyer and the classical baseline before it scores any quantum method.Read86Company Diligence MemoWrite a decision-grade quantum company diligence memo with source-labeled evidence, proof gates, kill criteria, and an action you can defend.Read87Public Playground MVPShape a public playground MVP: one coherent learning route with original explanation, checks, practice, assessment, and honest source boundaries.Read