Glossary

338 terms from Quantum Computing

# A B C D E F G H I J K L M N O P Q R S T U V W Y Z

#

$T$-count
the number of non-Clifford gates — and $n$ is the qubit count. Note what is *not* in that exponent: $n$. → Case Study: Why Clifford Circuits Are Not Enough
0 ns
virtual | ~0 | | $\sqrt{X}$ (SX) | 35 ns | $2\times10^{-4}$ | | $X$ | 35 ns | $2\times10^{-4}$ | | CNOT / ECR | 300–500 ns | $6\times10^{-3}$ | → Case Study: Compiling to a Native Gate Set
0.3891
39% low. The circuit is correct; the device is not. → Case Study: Zero-Noise Extrapolation and Its Shot Bill
1. Chemistry and Drug Discovery:
Calculating reaction rates and mechanisms - Designing catalysts (e.g., nitrogen fixation — the Haber-Bosch process involves a complex FeMo cofactor that classical methods struggle with) - Drug-target binding energies - Photochemistry and excited states → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
10 years (2030-2035):
First fault-tolerant quantum computers with 10-100 logical qubits - Demonstrated quantum advantage for chemistry (small molecules beyond classical reach) - Quantum networking over 100+ km distances - Quantum sensors with Heisenberg-limited precision in commercial products - Continued debate about wh → Chapter 32: Quantum Hype vs. Quantum Reality
2. Materials Science:
High-temperature superconductors (the Hubbard model, cuprates) - Battery materials (electrolyte decomposition, ion transport) - Solar cell materials (exciton dynamics) - Correlated electron materials (Mott insulators, topological phases) → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
2.25 lines per qubit
call it 2 for estimation. → Case Study: The Wiring Problem — Why Scaling Isn't Just More Qubits
20 years (2035-2045):
Fault-tolerant quantum computers with 1,000+ logical qubits - Cryptographically relevant quantum computers (breaking RSA-2048) - Quantum advantage for optimization, chemistry, and possibly ML - Early distributed quantum computing - Quantum internet prototypes - Mature quantum sensor industry → Chapter 32: Quantum Hype vs. Quantum Reality
20× better fidelity on the ion trap
from 9× better gates *and* 2.4× fewer of them. → Case Study: Fast Gates or Good Gates — Choosing a Platform for a Workload
3. Nuclear and Particle Physics:
Lattice gauge theories (QCD at finite density — a regime where classical Monte Carlo fails due to the sign problem) - Neutrino oscillations - Nuclear structure and reactions → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
4. Quantum Field Theory:
Scattering amplitudes in strongly coupled theories - False vacuum decay - Thermalization and quantum chaos → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
40 for everything else
counting registers, ancillas, and magic-state injection. → Case Study: Designing an Early Fault-Tolerant Algorithm
5 years (2025-2030):
NISQ devices with 100-1,000 physical qubits, improving gate fidelities - First demonstrations of quantum error correction with logical qubits - Quantum chemistry simulations of small molecules with chemical accuracy on NISQ devices (with error mitigation) - Quantum optimization heuristics (QAOA) tha → Chapter 32: Quantum Hype vs. Quantum Reality
5. Industrial Applications:
Haber-Bosch process optimization (fertilizer production consumes ~2% of global energy) - Carbon capture materials - OLED and organic semiconductor design → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
`H` fails Hermiticity and involutivity
because as typed it is missing nothing structurally, but let us check: $H = \frac{1}{\sqrt2}\begin{pmatrix}1&1\\1&-1\end{pmatrix}$ is symmetric and real, hence Hermitian, and $H^2 = I$. It passes. → Case Study: Validating a Gate Library Before You Trust It
~42 million physical qubits
roughly double the commonly quoted 20 million, which assumes better physical error rates than Willow demonstrated. → Case Study: Reading a Below-Threshold Experiment
~55 hours
for a model that logistic regression beats within 1.5 points in 3 milliseconds. → Case Study: Benchmarking a Quantum Classifier Honestly

A

A 31° phase error
coherent, reproducible, and correctable by inserting $R_z(-31°)$ before measurement or by fixing the underlying frame tracking. This is almost certainly the cause of the downstream algorithm misbehaving, because any algorithm relying on interference is sensitive to exactly this. 2. **14% dephasing** → Case Study: Reconstructing a Qubit from Measurement Counts
Achieve "quantum advantage" for practical problems
all demonstrations to date are on synthetic benchmarks 3. **Outperform classical ML on real datasets** — no convincing demonstration exists 4. **Simulate industrially relevant molecules** — FeMoco (nitrogenase active site) requires ~200 logical qubits 5. **Operate without significant error mitigatio → Chapter 32: Quantum Hype vs. Quantum Reality
Adiabatic Quantum Computing
A model of quantum computation based on the adiabatic theorem, where the system evolves slowly from an initial Hamiltonian to a final Hamiltonian whose ground state encodes the solution. → Glossary of Quantum Computing Terms
Advantages of flux qubits:
Large anharmonicity (up to several GHz) - Tunable frequency via external flux - Natural compatibility with inductive coupling → Chapter 26: Superconducting Qubits: Transmons, Flux Qubits, and the Hardware Inside IBM and Google Quantum Computers
Advantages of IPE over standard QPE:
**Qubit count:** IPE needs $m + 1$ qubits (one ancilla plus the eigenstate register), compared to $t + m$ for standard QPE. - **Circuit depth:** Each round is shallow (one controlled-$U^{2^k}$), but $t$ rounds are needed sequentially. - **Robustness:** Since each round uses a shallow circuit, IPE is → Chapter 16: Quantum Phase Estimation — The Subroutine That Powers Shor's, Simulation, and Half of Quantum Computing
Advantages of natural gradient:
Invariant to reparameterization of the ansatz. - Avoids pathological convergence along "valleys" in the energy landscape. - For VQE with UCCSD, natural gradient descent can converge in $O(1)$ iterations for quadratic landscapes, compared to $O(\kappa)$ iterations for vanilla gradient descent (where → Chapter 19: Variational Quantum Eigensolver (VQE) — Finding Ground State Energies for Chemistry and Materials Science
Always report classical baselines
at minimum logistic regression, SVM, and a small MLP, tuned with the same effort as the quantum model. 2. **Report the trivial baseline** (majority class). Many published QML accuracies are close to it. 3. **Vary training-set size** — the scaling curve is far more informative than any single number. → Case Study: Benchmarking a Quantum Classifier Honestly
Always use multiple random restarts
VQE landscapes have many local minima. → Chapter 19: Variational Quantum Eigensolver (VQE) — Finding Ground State Energies for Chemistry and Materials Science
Among survivors, compare rate
now, and not before. 5. **Check decoder availability.** A code with no fast decoder is unusable regardless of parameters. 6. **Check logical-gate support.** Transversality and lattice-surgery-style operations differ substantially between codes. → Case Study: Choosing a Code for a Given Hardware Architecture
Amplitude Amplification
A technique that boosts the probability amplitude of desired measurement outcomes, generalizing Grover's algorithm. → Glossary of Quantum Computing Terms
Ancilla Qubit
An auxiliary qubit used in a quantum computation, typically for temporary storage or to enable a specific gate operation. → Glossary of Quantum Computing Terms
Ansatz
A parameterized trial wavefunction used in variational quantum algorithms (VQE, QAOA). The choice of ansatz determines the expressiveness and trainability of the circuit. → Glossary of Quantum Computing Terms
Anyon
A quasiparticle in 2D systems with statistics between bosons and fermions. Relevant to topological quantum computing and surface code error syndromes. → Glossary of Quantum Computing Terms
anyons
quasiparticle excitations that signal the presence of errors. Error correction consists of pairing up anyons and annihilating them by applying Pauli operators along the connecting paths. → Chapter 25: Surface Codes and Fault-Tolerant Computation: The Path from Noisy Qubits to Reliable Quantum Computers
Applications of amplitude estimation:
Estimating the number of solutions to a search problem (quantum counting) - Estimating the expectation value of an observable in a quantum state - Monte Carlo simulation with quadratic speedup - Risk analysis in finance → Chapter 13: Grover's Algorithm — Searching an Unsorted Database in √N Instead of N — Quadratic Speedup for Unstructured Problems
Applications of quantum counting:
Determining $k_{\text{opt}}$ for Grover's algorithm when $M$ is unknown - Estimating the number of solutions to NP-hard optimization problems - Quantum walk algorithms that need to know the spectral gap - Approximate counting in databases (estimating the fraction of records satisfying a predicate) → Chapter 13: Grover's Algorithm — Searching an Unsorted Database in √N Instead of N — Quadratic Speedup for Unstructured Problems
asymptotically optimal
no quantum algorithm can do better than a quadratic speedup for unstructured search. → Chapter 13: Grover's Algorithm — Searching an Unsorted Database in √N Instead of N — Quadratic Speedup for Unstructured Problems

B

Barren Plateau
A phenomenon in variational quantum circuits where the gradient of the cost function vanishes exponentially with the number of qubits, making optimization impossible. → Glossary of Quantum Computing Terms
Basis
A set of orthonormal vectors that span a vector space. The computational basis for qubits is {|0⟩, |1⟩}. → Glossary of Quantum Computing Terms
BB84
The first quantum key distribution protocol, proposed by Bennett and Brassard in 1984. Uses polarized photons to establish a shared secret key. → Glossary of Quantum Computing Terms
Bell State
A maximally entangled two-qubit state. The four Bell states are |Φ⁺⟩, |Φ⁻⟩, |Ψ⁺⟩, |Ψ⁻⟩. → Glossary of Quantum Computing Terms
Bell states
mutually orthogonal and perfectly distinguishable. → Chapter 10: Superdense Coding, Quantum Key Distribution, and the Communication Applications of Entanglement
Bell's Inequality
A mathematical inequality that any local hidden variable theory must satisfy. Quantum mechanics violates Bell's inequality, proving that quantum correlations cannot be explained by local hidden variables. → Glossary of Quantum Computing Terms
Bernstein-Vazirani Algorithm
A quantum algorithm that learns a hidden bit string in a single oracle query, demonstrating exponential quantum advantage over classical algorithms. → Glossary of Quantum Computing Terms
Blind quantum computation
a client can run computations on a remote quantum server without revealing the computation - **Quantum sensor networks** with precision beyond the standard quantum limit - **Secure voting and auction protocols** leveraging quantum entanglement → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
Bloch Sphere
A geometric representation of a single qubit state as a point on the surface of a unit sphere. Pure states lie on the surface; mixed states lie inside. → Glossary of Quantum Computing Terms
Born Rule
The fundamental rule of quantum measurement: the probability of obtaining a measurement outcome is the squared magnitude of the inner product between the state and the measurement basis vector: P(m) = |⟨m|ψ⟩|². → Glossary of Quantum Computing Terms
Boson Sampling
A quantum computational task involving sampling from the output distribution of identical bosons passing through a linear optical network. Believed to be classically hard. → Glossary of Quantum Computing Terms
BQP (Bounded-error Quantum Polynomial time)
The complexity class of decision problems solvable by a quantum computer in polynomial time with error probability < 1/3. → Glossary of Quantum Computing Terms
Bra-Ket Notation
Dirac notation for quantum states: |ψ⟩ (ket) represents a column vector; ⟨ψ| (bra) represents its conjugate transpose (row vector). ⟨φ|ψ⟩ is the inner product. → Glossary of Quantum Computing Terms
Bravyi-Kitaev Transformation
A mapping from fermionic operators to qubit operators, used in quantum chemistry simulations. More efficient than Jordan-Wigner for certain molecular geometries. → Glossary of Quantum Computing Terms
Build
Construct quantum circuits using `QuantumCircuit` 2. **Transpile** — Optimize and map circuits to hardware constraints 3. **Execute** — Run on a simulator or real backend 4. **Analyze** — Process and visualize results → Chapter 8: Programming Quantum Computers with Qiskit: Your First Quantum Program on a Real Quantum Processor

C

Choosing the right simulator:
**Statevector:** Use when you need the full quantum state. Limited to ~30 qubits (memory: $2^n \times 16$ bytes). Best for debugging and verifying circuits. → Chapter 8: Programming Quantum Computers with Qiskit: Your First Quantum Program on a Real Quantum Processor
Circuit Depth
The number of sequential layers of gates in a quantum circuit. Deeper circuits are more susceptible to decoherence. → Glossary of Quantum Computing Terms
Circuit Knitting
A technique that decomposes large quantum circuits into smaller subcircuits that can be run independently, with classical post-processing to reconstruct the result. → Glossary of Quantum Computing Terms
Classical data
images, financial time series, text, tabular data. Loading dominates; dequantization results apply; classical ML is extraordinarily strong. Prognosis: poor, and the burden of proof should be heavy. → Case Study: Learning on Quantum Data — Where QML's Argument Is Strongest
Classical reduction
pick random $a$, check $\gcd(a,N)$. 2. **Quantum period finding** — superposition over $2^t \ge N^2$ values of $x$, then $|x\rangle|0\rangle \mapsto |x\rangle|a^x \bmod N\rangle$. 3. **Inverse QFT** on the counting register, then measure. 4. **Continued fractions** to recover $r$, then $\gcd(a^{r/2} → Case Study: Auditing a 'We Factored a Large Number' Claim
Classical Shadow
A technique for efficiently estimating many properties of a quantum state from a small number of measurements, using randomized measurement protocols. → Glossary of Quantum Computing Terms
Classical universality of Toffoli:
**AND gate:** Set target to 0. Toffoli with controls $a, b$ and target $c=0$ gives $|a, b, c \oplus ab\rangle = |a, b, ab\rangle$. - **NOT gate:** Toffoli with both controls set to $|1\rangle$ gives $|1, 1, c \oplus 1\rangle = |1, 1, \bar{c}\rangle$. - **NAND gate:** Toffoli followed by NOT on the t → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Clearly understood, specific plan
strong positive | | Published work | Real, properly verified, modest | | Revenue | Exploratory and grant-funded, not product | | Roadmap | Aggressive on qubits, silent on fidelity in public materials | | Team | Physics-heavy for a company shipping systems | → Case Study: Technical Due Diligence on a Quantum Startup
CNOT (Controlled-NOT)
A two-qubit gate that flips the target qubit if the control qubit is |1⟩. Essential for creating entanglement. → Glossary of Quantum Computing Terms
Coherence Time
The duration over which a qubit maintains its quantum state before decoherence destroys it. Characterized by T₁ (energy relaxation) and T₂ (phase coherence) times. → Glossary of Quantum Computing Terms
coherences
they encode the phase relationship between the basis states and are what distinguish a coherent superposition from a classical mixture. → Chapter 2: The Qubit: Superposition, the Bloch Sphere, and Why a Quantum Bit Is Fundamentally Different from a Classical Bit
coherent access to multiple copies simultaneously
entangling operations across two copies of $|\psi\rangle$ held in the register at once. That is a demanding experimental requirement, and it doubles the qubit count. → Case Study: Learning on Quantum Data — Where QML's Argument Is Strongest
Collapse Postulate
Upon measurement, a quantum state "collapses" to the eigenstate corresponding to the measurement outcome. The original superposition is irreversibly destroyed. → Glossary of Quantum Computing Terms
Compare $q_Q \times 12G$ against $q_C \times G$
and require the quantum side to win by enough to absorb error-correction overhead of $10^3$–$10^4$. 5. **Check circuit depth against the coherence or logical-error budget.** → Case Study: When the Oracle Costs More Than the Speedup
Comparison with classical algorithms:
Random assignment: approximation ratio 0.5 - Goemans-Williamson SDP: approximation ratio 0.878 - QAOA $p=1$: approximation ratio 0.692 - QAOA $p \to \infty$: approximation ratio 1.0 (in principle) → Chapter 20: QAOA — The Quantum Approximate Optimization Algorithm for Combinatorial Problems
complete set of commuting observables (CSCO)
a set of mutually commuting observables whose simultaneous eigenspaces are all one-dimensional. → Chapter 4: Measurement — The Born Rule, Projection, Collapse, and Why Observing a Qubit Changes It
Computational Basis
The standard basis {|0⟩, |1⟩} for a single qubit, extended via tensor products for multiple qubits. → Glossary of Quantum Computing Terms
Concrete implications:
**AES-128:** Classical security $2^{128}$, quantum security $2^{64}$. NIST recommends AES-256 for post-quantum security. - **AES-192:** Classical security $2^{192}$, quantum security $2^{96}$. - **AES-256:** Classical security $2^{256}$, quantum security $2^{128}$. Still considered secure against qu → Chapter 13: Grover's Algorithm — Searching an Unsorted Database in √N Instead of N — Quadratic Speedup for Unstructured Problems
connectivity
which stabilizers you can measure without shuttling qubits across the chip. → Case Study: Choosing a Code for a Given Hardware Architecture
Controlled Gate
A gate that applies an operation to target qubit(s) only when control qubit(s) are in a specific state (typically |1⟩). → Glossary of Quantum Computing Terms
Cooper Pair
A bound pair of electrons in a superconductor, responsible for superconductivity. Josephson junctions exploit Cooper pair tunneling to create superconducting qubits. → Glossary of Quantum Computing Terms
Cooper pairs
bound pairs of electrons with opposite spin and momentum, mediated by phonon exchange in the crystal lattice. These composite bosons condense into a macroscopic quantum state described by a single wavefunction: → Chapter 26: Superconducting Qubits: Transmons, Flux Qubits, and the Hardware Inside IBM and Google Quantum Computers
Cross-Resonance Gate
A two-qubit gate used in superconducting architectures, where driving one qubit at the frequency of a neighboring qubit induces a controlled rotation. → Glossary of Quantum Computing Terms
CSS Code (Calderbank-Shor-Steane)
A class of quantum error-correcting codes constructed from two classical linear codes, one for bit-flip errors and one for phase-flip errors. → Glossary of Quantum Computing Terms
Current deployments:
**China:** The Beijing-Shanghai backbone (2,000 km) connects multiple QKD nodes. The Micius satellite provides intercontinental QKD. - **Europe:** The EU Quantum Internet Alliance is building a quantum network connecting Delft, Amsterdam, Leiden, and The Hague (2024-2025). - **US:** The US Quantum I → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
Current state (2024-2025):
Largest superconducting processors: $\sim 1{,}000$ physical qubits - Best two-qubit gate fidelity: $\sim 99.9\%$ - Longest coherence time: $\sim 1$ ms (superconducting), $\sim 10$ s (trapped ions) - No demonstrated error-corrected logical qubit with $< 10^{-6}$ logical error rate → Chapter 15: Shor's Algorithm — Factoring Large Numbers in Polynomial Time (and Why It Breaks RSA Encryption)
Current state-of-the-art:
IBM's 1,121-qubit Condor processor uses over 2,000 coaxial cables. - Each cable must be thermally anchored at multiple temperature stages (300 K → 4 K → 100 mK → 20 mK). - The heat load per cable is $\sim 1$ mW at 4 K and $\sim 1$ $\mu$W at 20 mK. → Chapter 26: Superconducting Qubits: Transmons, Flux Qubits, and the Hardware Inside IBM and Google Quantum Computers

D

D-Wave
A company that builds quantum annealers, specialized quantum computers that solve optimization problems using adiabatic quantum computing principles. → Glossary of Quantum Computing Terms
data re-uploading
increases the model's expressiveness by embedding the data multiple times at different stages of the quantum computation. → Chapter 21: Quantum Machine Learning — Variational Circuits, Quantum Kernels, and the Search for Quantum Advantage in ML
DataField.Dev
A free, open-source textbook on quantum computing: the physics, the mathematics, the algorithms, the error correction, and the hardware — with every algorithm implemented in Qiskit and runnable on real quantum processors. → Quantum Computing
Decoherence
The loss of quantum coherence due to unwanted interactions with the environment. The primary obstacle to building large-scale quantum computers. → Glossary of Quantum Computing Terms
destroyed
the amplitudes $\alpha, \beta$ are irreversibly projected onto the Bell basis outcomes. Bob's qubit receives the state, but there is never a moment when two copies exist. The no-cloning theorem is respected. → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
Detailed migration challenges:
**Key size increases**: Kyber-768 public keys are 1,184 bytes vs. 64 bytes for ECC-P256. This affects TLS handshakes, certificate chains, and constrained devices. - **Performance**: PQC operations are slower than ECC (5–50× for key generation, 2–10× for signing/verification). Hardware acceleration w → Chapter 30: Quantum Cryptography and Post-Quantum Security
Detailed threshold estimates:
**Surface code threshold:** $\sim 1\%$ error rate for depolarizing noise (Fowler et al., 2012). Current superconducting qubits achieve 0.1-1% two-qubit gate error rates — just at or below threshold. - **Logical qubit overhead:** At physical error rate $p = 10^{-3}$, achieving logical error rate $p_L → Chapter 18: The NISQ Era — Noisy Intermediate-Scale Quantum Computers and the Algorithms Designed for Imperfect Hardware
Detector blinding
bright illumination forces avalanche photodiodes into linear mode, where they respond classically and Eve controls Bob's outcomes without raising QBER. - **Photon-number splitting** — imperfect single-photon sources occasionally emit two photons; Eve keeps one. (Decoy states, which this proposal inc → Case Study: Evaluating a QKD Procurement Proposal
Deutsch-Jozsa Algorithm
A quantum algorithm that determines whether a function is constant or balanced in a single query, demonstrating exponential quantum advantage. → Glossary of Quantum Computing Terms
Dirac Notation
See Bra-Ket Notation. → Glossary of Quantum Computing Terms
Disadvantages:
Computing the full metric tensor requires $O(p^2)$ circuit evaluations per iteration, which is expensive for large parameter counts. - The metric tensor can be singular or near-singular, requiring regularization. - On noisy hardware, the metric tensor estimates are unreliable due to shot noise. → Chapter 19: Variational Quantum Eigensolver (VQE) — Finding Ground State Energies for Chemistry and Materials Science
Dispersive Readout
A qubit measurement technique where the qubit's state is inferred from the phase shift it imparts on a microwave probe tone coupled to a resonator. → Glossary of Quantum Computing Terms
dissociation curve
the ground state energy as a function of interatomic distance. This reveals bond lengths, bond energies, and the quality of the ansatz at strong correlation (large bond distances). → Chapter 19: Variational Quantum Eigensolver (VQE) — Finding Ground State Energies for Chemistry and Materials Science
dynamic circuits
circuits where the result of a mid-circuit measurement determines subsequent operations. This enables feed-forward control, adaptive algorithms, and error correction. → Chapter 8: Programming Quantum Computers with Qiskit: Your First Quantum Program on a Real Quantum Processor

E

E91 Protocol
A quantum key distribution protocol proposed by Ekert in 1991, using Bell's inequality to detect eavesdropping. → Glossary of Quantum Computing Terms
Eigenvalue / Eigenvector
For an operator A, an eigenvector |v⟩ satisfies A|v⟩ = λ|v⟩, where λ is the eigenvalue. Measurement outcomes are eigenvalues of the observable. → Glossary of Quantum Computing Terms
Emerging educational programs:
**MIT's Quantum Information Science program** (graduate-level) - **University of Waterloo's Institute for Quantum Computing** (undergraduate and graduate) - **ETH Zurich's Master's in Quantum Engineering** (graduate) - **TU Delft's Master's in Quantum Computer Science** (graduate) - **University of → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
Entanglement
A quantum correlation between qubits that cannot be described classically. Measuring one entangled qubit instantly determines the state of the other, regardless of distance. → Glossary of Quantum Computing Terms
entanglement purification
consuming several low-fidelity pairs to distill one higher-fidelity pair — is mandatory in any real repeater design, not optional. → Case Study: Teleportation as Architecture — Repeaters and Gate Teleportation
entire Clifford group transversal
$H$, $S$, and CNOT all apply bitwise, which is exactly what fault tolerance requires (Chapter 25). That property comes directly from $C_1 = C_2^\perp$ being the same code, and it is why Steane remains a reference point three decades on. → Case Study: From Hamming to Steane — Building a Quantum Code from Classical Parts
Entry Points:
**Master's programs:** ETH Zurich, TU Delft, University of Waterloo, MIT, Caltech, Oxford, University of Chicago - **Internships:** IBM Quantum, Google Quantum AI, Microsoft Quantum, and most startups offer summer internships - **Open-source contributions:** Qiskit, Cirq, PennyLane, and OpenFermion → Chapter 31: The Quantum Computing Industry
EPR Paradox
Einstein, Podolsky, and Rosen's 1935 argument that quantum mechanics must be incomplete because it allows "spooky action at a distance" (entanglement). Resolved by Bell's theorem. → Glossary of Quantum Computing Terms
Error contribution: 0.
Eve's basis differs from Alice's with probability ½. Her measurement collapses the state into her basis — now uncorrelated with Alice's encoding. She resends it, and Bob, measuring in Alice's basis, gets a uniformly random bit: right half the time. **Error contribution: ½ × ½ = ¼.** → Case Study: Catching Eve — Running BB84 with an Eavesdropper
Error Mitigation
Techniques to reduce the impact of noise on quantum computation results without full error correction. Includes readout error mitigation, zero-noise extrapolation, and probabilistic error cancellation. → Glossary of Quantum Computing Terms
Error mitigation strategies:
**Readout error mitigation:** Characterize the readout error matrix and apply its inverse to the measurement statistics. - **Zero-noise extrapolation:** Run the circuit at multiple noise levels and extrapolate to zero noise. - **Randomized compiling:** Convert deterministic errors into stochastic er → Chapter 12: The Deutsch-Jozsa and Bernstein-Vazirani Algorithms — Simple Problems, Exponential Speedup, and the First Taste of Quantum Advantage
Error mitigation vs. error correction:
**Error mitigation** (zero-noise extrapolation, probabilistic error cancellation): Improves results by post-processing, without additional qubits. Effective for shallow circuits. → Key Takeaways: Chapter 6 — Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Error Syndrome
The pattern of stabilizer measurement outcomes that identifies which error occurred, without revealing the encoded quantum information. → Glossary of Quantum Computing Terms
Examples:
$n = 10$ bits, $\epsilon = 0.01$ (99% confidence): $t = 10 + \lceil \log_2(52) \rceil = 10 + 6 = 16$ qubits - $n = 10$ bits, $\epsilon = 0.001$ (99.9% confidence): $t = 10 + \lceil \log_2(502) \rceil = 10 + 9 = 19$ qubits - $n = 20$ bits, $\epsilon = 0.01$ (99% confidence): $t = 20 + 6 = 26$ qubits → Chapter 16: Quantum Phase Estimation — The Subroutine That Powers Shor's, Simulation, and Half of Quantum Computing
Excited states and photochemistry
**Lattice gauge theories at finite density** (sign problem) → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
Expected behavior:
For the constant oracle, all probability concentrates on $|000\rangle$. - For the balanced oracle, $|000\rangle$ has zero probability and probability is distributed among other states. → Chapter 11: Quantum Parallelism and Interference — How Quantum Algorithms Get Their Speedup
Expected output (key results):
After 1 iteration: $P(\text{marked}) \approx 0.781$ - After 2 iterations: $P(\text{marked}) \approx 0.945$ - After 3 iterations: $P(\text{marked}) \approx 0.330$ (overshooting!) → Chapter 13: Grover's Algorithm — Searching an Unsorted Database in √N Instead of N — Quadratic Speedup for Unstructured Problems
Expert estimates for RSA-2048 factoring:
**Optimistic:** 2035-2040 (accelerated by new algorithms and hardware breakthroughs) - **Moderate:** 2040-2050 (assuming steady progress along current roadmaps) - **Conservative:** 2050+ (accounting for unforeseen engineering challenges) → Chapter 15: Shor's Algorithm — Factoring Large Numbers in Polynomial Time (and Why It Breaks RSA Encryption)
Extending the portfolio:
Add new algorithms as you learn them (quantum phase estimation, quantum walk, quantum key distribution) - Compare results across different hardware backends - Implement error mitigation techniques and measure their impact - Contribute your best implementations to open-source projects → Chapter 33: Capstone: Your Quantum Algorithm Portfolio — Implemented, Executed on Real Hardware, and Analyzed
Extrapolation methods:
**Linear:** $f(\lambda) = a + b\lambda$. Requires 2 noise levels. Assumes noise is linear. - **Quadratic:** $f(\lambda) = a + b\lambda + c\lambda^2$. Requires 3 noise levels. Accounts for curvature. - **Exponential:** $f(\lambda) = a + b \cdot e^{-c\lambda}$. Accounts for saturation at high noise. → Chapter 18: The NISQ Era — Noisy Intermediate-Scale Quantum Computers and the Algorithms Designed for Imperfect Hardware
Extrapolation models:
**Linear:** $E(\lambda) = E_0 + a\lambda$ - **Polynomial:** $E(\lambda) = E_0 + a\lambda + b\lambda^2$ - **Exponential:** $E(\lambda) = E_0 e^{-b\lambda} + E_\infty(1 - e^{-b\lambda})$ → Chapter 19: Variational Quantum Eigensolver (VQE) — Finding Ground State Energies for Chemistry and Materials Science

F

Fault-Tolerant Quantum Computation
Quantum computation that remains reliable even when individual components are noisy, achieved through quantum error correction and careful gate design. → Glossary of Quantum Computing Terms
FeMoco (active space):
Spin-orbitals: $M = 108$ - Qubits (JW): ~108 - Hamiltonian terms: ~$10^6$ - Trotter steps for chemical accuracy: ~$10^5$ - Total two-qubit gates: ~$10^{11}$ - Feasible on NISQ devices? No (requires fault-tolerant QC) → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
Fidelity
A measure of how close a quantum state or gate operation is to the ideal. Gate fidelity of 99.9%+ is needed for fault-tolerant computation. → Glossary of Quantum Computing Terms
For a shallow, wide circuit
a large GHZ state, a sampling demonstration, a hardware-efficient ansatz spanning many qubits — Vendor A may genuinely be better, if its qubits are usable. - **For anything requiring depth** — the overwhelming majority of algorithms — Vendor B is better by a wide margin. Depth is the binding constra → Case Study: Reading a Benchmark — Quantum Volume and Its Discontents
For each algorithm, include:
Mathematical derivation (in LaTeX) - Circuit diagram (ASCII art) - Complete Qiskit implementation - Ideal simulation results - Hardware results (with backend name and date) - Noise analysis and fidelity comparison - Discussion of discrepancies between ideal and hardware results → Chapter 33: Capstone: Your Quantum Algorithm Portfolio — Implemented, Executed on Real Hardware, and Analyzed
Foundations
qubits, superposition, the Bloch sphere, the linear algebra of quantum computing, measurement and the Born rule, entanglement and Bell states, and the universal gate set. - **Circuits and programming** — universal gate sets, circuit depth, Qiskit, and the entanglement protocols: teleportation, super → Quantum Computing
Fredkin Gate (CSWAP)
A three-qubit gate that swaps two target qubits if the control qubit is |1⟩. Universal for classical reversible computation. → Glossary of Quantum Computing Terms
Fusion-based architectures have a loss threshold
roughly a few percent per component for the best schemes. Above it, no amount of multiplexing helps: the cluster state cannot be built faster than loss destroys it. → Case Study: The Photonic Bet — Trading Determinism for Room Temperature

G

Gate count analysis:
Hadamard gates: $n$ - Controlled rotations: $n(n-1)/2$ - SWAP gates: $n/2$ (each SWAP requires 3 CNOTs) - Total: $n + n(n-1)/2 + 3n/2 = O(n^2)$ → Chapter 16: Quantum Phase Estimation — The Subroutine That Powers Shor's, Simulation, and Half of Quantum Computing
Gate count:
$n$ Hadamard gates - $n(n-1)/2$ controlled phase gates - Total: $O(n^2)$ gates → Chapter 14: The Quantum Fourier Transform — The Mathematical Engine Inside the Most Important Quantum Algorithms
Gate Decomposition
Expressing a complex quantum gate as a sequence of simpler gates from a universal gate set. → Glossary of Quantum Computing Terms
Gate decomposition into native gates:
$H = R_z(\pi/2) \cdot \sqrt{X} \cdot R_z(\pi/2)$ (up to global phase) - $X = \sqrt{X} \cdot \sqrt{X}$ (two $\sqrt{X}$ gates) - $T = R_z(\pi/4)$ (native, since $R_z$ is native) - $S = R_z(\pi/2)$ (native) → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
General mitigations:
**Serve the smallest adequate parameter set.** ML-KEM-768 is the recommended level; ML-KEM-1024 costs more bytes for security most deployments do not need. - **Ensure clean fallback.** TLS negotiation should degrade to classical when the client cannot do hybrid — verified explicitly, not assumed. - → Case Study: Migrating a TLS Stack to Post-Quantum Cryptography
Genuine candidate
and a central open problem | | FeMoco active space | ✗ | ✗ | ✗ | **Genuine candidate** | | Frustrated 2D spin liquid | ✗ | — | ✗ (sign) | **Genuine candidate** | | Protein folding energetics | — | ✓ (force fields adequate) | — | **Not a quantum problem** — classical MD suffices | → Case Study: Is This Problem Actually Hard Classically?
getting the spectrum out
and shows that both are exponentially expensive, which is why no quantum signal-processing product exists despite the QFT being twenty-five years old. → Case Study: The QFT Is Not a Faster FFT
GHZ state
a maximally entangled state of three qubits. Note that this is *not* three copies of $|\psi\rangle$ (which would violate the no-cloning theorem). The information is stored in the entanglement, not in individual qubits. → Chapter 23: Classical Error Correction Review: Repetition Codes, Hamming Codes, and Why Quantum Is Harder (No-Cloning Theorem)
Grover's Algorithm
A quantum search algorithm that finds a marked item in an unsorted database of N items in O(√N) queries, providing quadratic speedup over classical search. → Glossary of Quantum Computing Terms
Grover's algorithm applies broadly
any problem reducible to "find $x$ such that $P(x)$" benefits from a quadratic speedup. This includes SAT, graph problems, collision finding, and cryptanalysis. → Key Takeaways: Chapter 13 — Grover's Algorithm — Searching an Unsorted Database in √N Instead of N — Quadratic Speedup for Unstructured Problems

H

H$_2$ (STO-3G basis):
Spin-orbitals: $M = 4$ - Qubits (after symmetry reduction): 2 - Hamiltonian terms: ~5 (after reduction) - Trotter steps for chemical accuracy: ~50 - Total two-qubit gates: ~500 - Feasible on NISQ devices? Yes (demonstrated on IBM Q in 2017) → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
Hadamard Gate (H)
A single-qubit gate that creates equal superposition: H|0⟩ = (|0⟩ + |1⟩)/√2, H|1⟩ = (|0⟩ − |1⟩)/√2. → Glossary of Quantum Computing Terms
half the threshold error rate
genuinely below it, but only just. → Case Study: Reading a Below-Threshold Experiment
Hamiltonian
The operator representing the total energy of a quantum system. Time evolution is governed by the Hamiltonian via the Schrödinger equation. → Glossary of Quantum Computing Terms
Hardware-Efficient Ansatz
A variational circuit design using gates native to the specific quantum hardware, minimizing the need for gate decomposition. → Glossary of Quantum Computing Terms
Hermitian Operator
An operator equal to its own conjugate transpose (A = A†). Observables in quantum mechanics are represented by Hermitian operators, guaranteeing real eigenvalues. → Glossary of Quantum Computing Terms
HHL Algorithm
A quantum algorithm for solving linear systems of equations, proposed by Harrow, Hassidim, and Lloyd. Offers exponential speedup under certain conditions. → Glossary of Quantum Computing Terms
High
the algorithms exist and the standards are published | Low — no proven commercial advantage yet | → Case Study: Should Your Organization Have a Quantum Program?
Hilbert Space
A complete vector space with an inner product. Quantum states live in Hilbert spaces: C² for one qubit, (C²)^⊗n for n qubits. → Glossary of Quantum Computing Terms
Historical precedents for technology winters:
**AI Winter 1 (1974-1980):** After early optimism about symbolic AI, funding collapsed when systems failed to scale beyond toy problems. - **AI Winter 2 (1987-1993):** After the expert systems boom, funding collapsed when maintenance costs exceeded benefits. - **Nuclear Winter (1990s-2000s):** Nucle → Chapter 32: Quantum Hype vs. Quantum Reality
How to interpret calibration data:
**T1 (energy relaxation time):** How long a qubit in $|1\rangle$ takes to decay to $|0\rangle$. Longer is better. Typical values: 50-500 μs. - **T2 (dephasing time):** How long a qubit maintains phase coherence. Longer is better. Typically T2 < T1. - **Gate error rates:** Probability that a gate pro → Chapter 8: Programming Quantum Computers with Qiskit: Your First Quantum Program on a Real Quantum Processor

I

I would move it substantially later if:
Below-threshold operation fails to improve beyond $\Lambda \approx 3$ for five years. - A classical algorithm dequantizes the leading simulation advantage. - Decoder latency proves an unexpected hard barrier. - Funding contracts sharply, slowing all components at once. → Case Study: Forecasting Honestly — What Would Change Your Mind?
If you want to build quantum hardware:
Study superconducting circuits, ion traps, or photonics. - Learn about cryogenics, microwave engineering, and laser optics. - Join a quantum hardware company or academic lab. → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
If you want to build quantum software:
Master Qiskit, Cirq (Google), PennyLane (Xanadu), and Amazon Braket. - Contribute to open-source quantum software: Qiskit, PennyLane, OpenFermion, QuTiP. - Build a portfolio of quantum projects on GitHub. - Participate in IBM Quantum challenges and Qiskit hackathons. → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
If you want to research quantum algorithms:
Read Nielsen & Chuang cover to cover. - Study complexity theory: BQP, QMA, postBQP. - Follow arXiv quant-ph for the latest developments. - Consider a PhD in quantum information science. → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
in principle
not as a product limitation, but because key distribution is not authentication. → Case Study: Evaluating a QKD Procurement Proposal
In-Demand Roles:
**Quantum Hardware Engineer:** PhD in experimental physics, expertise in cryogenics, microwave engineering, or laser systems - **Quantum Software Engineer:** MS/PhD in computer science or physics, proficiency in Qiskit/Cirq/PennyLane, classical HPC experience - **Quantum Algorithms Researcher:** PhD → Chapter 31: The Quantum Computing Industry
information-theoretic security
security guaranteed by the laws of quantum mechanics, independent of the adversary's computational power. → Chapter 10: Superdense Coding, Quantum Key Distribution, and the Communication Applications of Entanglement
Inner Product
A bilinear operation ⟨φ|ψ⟩ that measures the overlap between two quantum states. The squared magnitude gives the probability of distinguishing them. → Glossary of Quantum Computing Terms
Interference
The constructive or destructive combination of probability amplitudes. Quantum algorithms use interference to amplify correct answers and cancel wrong ones. → Glossary of Quantum Computing Terms
Ion Trap
A device that confines charged atoms (ions) using electromagnetic fields. Trapped ions serve as high-fidelity qubits manipulated by lasers. → Glossary of Quantum Computing Terms
Ising Model
A mathematical model of ferromagnetism, also used to encode combinatorial optimization problems for quantum computers (QAOA, quantum annealing). → Glossary of Quantum Computing Terms

J

Jordan-Wigner sign
it accounts for the antisymmetry of fermionic states under exchange. → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
Jordan-Wigner Transformation
A mapping from fermionic creation/annihilation operators to Pauli operators on qubits, enabling quantum simulation of fermionic systems. → Glossary of Quantum Computing Terms
Josephson Junction
A weak link between two superconductors. The nonlinear inductance of Josephson junctions creates the anharmonicity needed for superconducting qubits. → Glossary of Quantum Computing Terms

K

Ket
See Bra-Ket Notation. → Glossary of Quantum Computing Terms
Key advantages:
Photons travel at the speed of light through optical fiber - Low decoherence (photons don't easily interact with their environment) - Compatible with existing telecom infrastructure → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
Key challenges for satellite QKD:
**Atmospheric loss:** Photons scatter in the atmosphere, reducing the key rate - **Pointing accuracy:** The satellite must track the ground station with microradian precision - **Background light:** Sunlight and other light sources introduce errors - **Limited contact time:** A LEO satellite passes → Chapter 10: Superdense Coding, Quantum Key Distribution, and the Communication Applications of Entanglement
Key challenges:
No deterministic Bell measurement with linear optics (only 50% success probability) - High photon loss in fiber (0.2 dB/km at telecom wavelengths) - No natural photon-photon interaction (hard to create deterministic entangling gates) → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
Key details:
Task: Sample from the output distribution of random quantum circuits - Qubits: 53 transmon qubits - Circuit depth: 20 cycles of random SU(4) gates - Fidelity: ~0.2% (meaning ~99.8% of the output is noise) - Classical simulation time (Google estimate): ~10,000 years - Classical simulation time (IBM e → Chapter 18: The NISQ Era — Noisy Intermediate-Scale Quantum Computers and the Algorithms Designed for Imperfect Hardware
Key propagation rules:
**Bit flip ($X$) through CNOT:** $X$ on the control propagates to both control and target. $X$ on the target stays on the target. - $\text{CNOT} \cdot (X \otimes I) = (X \otimes X) \cdot \text{CNOT}$ - $\text{CNOT} \cdot (I \otimes X) = (I \otimes X) \cdot \text{CNOT}$ → Chapter 22: Why Quantum Error Correction Is Necessary: Decoherence, Gate Errors, and the Fragility of Quantum Information
Key properties of HHL:
Runtime: $O(\log N \cdot s^2 \kappa^2 / \epsilon)$ where $N$ is the matrix dimension, $s$ is the sparsity, $\kappa$ is the condition number, and $\epsilon$ is the desired precision. - Exponential speedup over classical $O(N\sqrt{\kappa})$ for dense matrices. - But: only produces a quantum state $|x\ → Chapter 16: Quantum Phase Estimation — The Subroutine That Powers Shor's, Simulation, and Half of Quantum Computing
Key properties:
For $p > 1/3$: the state is entangled (concurrence > 0) - For $p \leq 1/3$: the state is separable (can be written as a mixture of product states) - For $p > 1/\sqrt{2} \approx 0.707$: the state violates the CHSH inequality → Chapter 5: Multiple Qubits — Tensor Products, Entanglement, Bell States, and the Resource That Makes Quantum Computing Powerful
Key results from Google (2024–2025):
The Willow chip demonstrated that logical error rates decrease exponentially with code distance from $d=3$ to $d=7$. - Below-threshold operation: logical $T_1$ time exceeded physical $T_1$ by a factor of 2× for $d=5$. - Real-time decoding of surface code syndromes at MHz rates. → Chapter 25: Surface Codes and Fault-Tolerant Computation: The Path from Noisy Qubits to Reliable Quantum Computers
Key results:
$e_P(I \otimes I) = 0$ (identity creates no entanglement) - $e_P(\text{SWAP}) = 0$ (SWAP permutes qubits but doesn't create entanglement from product states) - $e_P(\text{CNOT}) = 1$ (CNOT can create maximal entanglement: $H \otimes I$ followed by CNOT creates a Bell state) - $e_P(\text{CZ}) = 1$ (C → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Key subclasses of NP:
**NP-complete:** The hardest problems in NP. Every problem in NP can be reduced to any NP-complete problem in polynomial time. If you can solve one NP-complete problem in polynomial time, you can solve *all* of them. Examples: SAT, 3-coloring, Hamiltonian path, knapsack. - **NP-intermediate (if P ≠ → Chapter 1: Why Quantum Computing? What Quantum Computers Can Do That Classical Computers Can't (and What They Can't Do Better)
Key technical details:
Platform: NMR on a custom-synthesized molecule with 7 addressable spins - The 7-qubit molecule was a custom-synthesized perfluorobutadienyl iron complex (five $^{19}$F and two $^{13}$C spins), made for the experiment by IBM chemists Yannoni and Breyta - Pulse sequence: ~300 radiofrequency pulses - T → Chapter 15: Shor's Algorithm — Factoring Large Numbers in Polynomial Time (and Why It Breaks RSA Encryption)
Knill-Laflamme Conditions
Necessary and sufficient conditions for a quantum code to correct a given set of errors. → Glossary of Quantum Computing Terms
Kraus Operators
A set of operators that describe the effect of a quantum noise channel on a density matrix. Used in the operator-sum representation of quantum operations. → Glossary of Quantum Computing Terms

L

Lattice-Based Cryptography
A class of post-quantum cryptographic schemes based on the hardness of lattice problems like Learning With Errors (LWE). NIST-standardized (CRYSTALS-Kyber, CRYSTALS-Dilithium). → Glossary of Quantum Computing Terms
Layer 1: Physical
Photon generation, detection, quantum memories → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
Entanglement generation and purification between neighbors → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
Layer 3: Network
Entanglement routing, path selection → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
Layer 4: Transport
End-to-end qubit delivery (via teleportation) → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
Layer 5: Application
QKD, distributed sensing, blind computing → Chapter 9: Quantum Teleportation: Transmitting Quantum Information Using Entanglement (It's Not Sci-Fi — It's a Protocol)
LiH (STO-3G basis):
Spin-orbitals: $M = 12$ (6 spatial × 2 spin) - After active space reduction: ~6 qubits - Hamiltonian terms: ~100 - Trotter steps for chemical accuracy: ~1000 - Total two-qubit gates: ~200,000 - Feasible on NISQ devices? Marginal (error mitigation required) → Chapter 17: Quantum Simulation — Modeling Molecules, Materials, and Physics That Classical Computers Can't Handle
Linear algebra and probability theory
the mathematical foundation of quantum mechanics 2. **Quantum mechanics** — the physical principles underlying quantum computing 3. **Computer science** — algorithms, complexity theory, and software engineering 4. **Domain expertise** — chemistry, finance, optimization, or another application area → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
Locality loophole
Alice and Bob must be spacelike separated when choosing settings. On a chip, the qubits are microns apart. Wide open. - **Detection loophole** — enough of the pairs must be detected that the sample is not cherry-picked. Superconducting readout is near-deterministic, so this one is effectively closed → Case Study: Running a CHSH Test on Real Hardware
Logical Qubit
An error-corrected qubit encoded across multiple physical qubits. Logical qubits have much lower effective error rates than physical qubits. → Glossary of Quantum Computing Terms

M

Magic State Distillation
A procedure for creating high-fidelity "magic states" from noisy ones, enabling non-Clifford gates in fault-tolerant quantum computation. → Glossary of Quantum Computing Terms
MaxCut
A combinatorial optimization problem: partition a graph's vertices to maximize the number of edges between partitions. A canonical benchmark for QAOA. → Glossary of Quantum Computing Terms
Measurement
The process of extracting classical information from a quantum state. Measurement is probabilistic (Born rule) and destructive (collapse). → Glossary of Quantum Computing Terms
Measurement is not passive observation
it is an active, irreversible process that projects the state and yields probabilistic outcomes. 8. **The Helstrom bound** gives the maximum probability of correctly distinguishing two quantum states. It is a fundamental limit on quantum information processing. 9. **The uncertainty relation** constr → Key Takeaways: Chapter 4 — Measurement — The Born Rule, Projection, Collapse, and Why Observing a Qubit Changes It
measurement problem
the fundamental barrier to using the QFT as a fast classical FFT. The QFT places exponentially many Fourier coefficients into a quantum state, but we can only extract $n$ bits of classical information from this state. → Chapter 14: The Quantum Fourier Transform — The Mathematical Engine Inside the Most Important Quantum Algorithms
mirror images
[ ] Circuit-library components checked for their own convention - [ ] Every basis-state test written with an explicit label, never an integer index → Case Study: Debugging a Quantum Program That Returns Plausible Garbage
Mitigation strategies:
**Local cost functions:** Measure only a few qubits rather than all. Local cost functions $\langle h_i \rangle$ with $h_i$ acting on a constant number of qubits have gradient variance $O(1/\text{poly}(n))$, avoiding barren plateaus. - **Shallow circuits:** Limit depth to $O(\log n)$. Shallow circuit → Chapter 21: Quantum Machine Learning — Variational Circuits, Quantum Kernels, and the Search for Quantum Advantage in ML
Mitigations:
Use problem-inspired ansatzes (UCCSD) rather than hardware-efficient ones — they are not 2-designs. - Employ layerwise training strategies — train one layer at a time, freezing previous layers. - Use correlated parameter initialization — start near the Hartree-Fock state. - Employ local cost functio → Chapter 19: Variational Quantum Eigensolver (VQE) — Finding Ground State Energies for Chemistry and Materials Science
Mixed State
A statistical ensemble of pure quantum states, represented by a density matrix ρ. Mixed states arise from entanglement with an environment or incomplete knowledge. → Glossary of Quantum Computing Terms
Mixed states
classical probabilistic mixtures of quantum states—live inside the sphere. A mixed state has Bloch vector with $|\vec{r}| < 1$. → Chapter 2: The Qubit: Superposition, the Bloch Sphere, and Why a Quantum Bit Is Fundamentally Different from a Classical Bit
Moderate scenario (2035-2045):
Scalable error correction demonstrated - 1,000-10,000 logical qubits - Quantum advantage for specific industrial applications - Early fault-tolerant quantum computers as cloud services → Chapter 32: Quantum Hype vs. Quantum Reality
Mølmer-Sørensen Gate
A two-qubit entangling gate for trapped ions, using bichromatic laser fields to create a state-dependent force. → Glossary of Quantum Computing Terms

N

NISQ
Noisy Intermediate-Scale Quantum — to describe the era of quantum computing we now inhabit. The phrase captures three essential realities: → Chapter 18: The NISQ Era — Noisy Intermediate-Scale Quantum Computers and the Algorithms Designed for Imperfect Hardware
NISQ (Noisy Intermediate-Scale Quantum)
The current era of quantum computing (term coined by John Preskill, 2018): devices with 50-1000 qubits that are too noisy for full error correction but may still outperform classical computers for specific tasks. → Glossary of Quantum Computing Terms
No
needs public-key infrastructure | | Code signing / firmware | Continuous | **No** — needs signatures | | SWIFT message authentication | ~90k/day | **No** — needs signatures | | Database encryption at rest | 2.4 PB | **No** — symmetric, already fine | | Backup archive keys | 25-year retention | **No* → Case Study: Evaluating a QKD Procurement Proposal
no gates at all
just prepare each basis state and measure it. → Case Study: Measurement Error Mitigation on a Noisy Processor
No-Cloning Theorem
It is impossible to create an identical copy of an arbitrary unknown quantum state. This theorem is fundamental to quantum cryptography and error correction. → Glossary of Quantum Computing Terms
Noise amplification methods:
**Unitary folding:** Replace each gate $G$ with $G \cdot G^{-1} \cdot G$ (which is equivalent to $G$ but with 3× the noise). More generally, fold $k$ times for noise amplification factor $\lambda = 2k + 1$. - **Gate stretching:** Increase the duration of each gate by factor $\lambda$, which increase → Chapter 18: The NISQ Era — Noisy Intermediate-Scale Quantum Computers and the Algorithms Designed for Imperfect Hardware
Noise Channel
A mathematical model of how quantum information degrades. Common channels: bit-flip, phase-flip, amplitude damping, depolarizing. → Glossary of Quantum Computing Terms
Noise is the enemy
even small amounts of residual motional excitation degrade gate fidelity. → Chapter 27: Trapped Ion Qubits: Individual Atoms Manipulated by Lasers — IonQ, Quantinuum, and the Highest-Fidelity Qubits
Noise scaling methods:
**Gate stretching:** Increase the duration of gates (only possible with pulse-level control). - **Unitary folding:** Insert identity-equivalent gate sequences ($G G^\dagger$) to effectively increase depth. - **Local folding:** Fold individual gates: $G \to G (G^\dagger G)^n$. → Chapter 19: Variational Quantum Eigensolver (VQE) — Finding Ground State Energies for Chemistry and Materials Science
non-Clifford operations
specifically, the $T$ gate (or any gate outside the Clifford group). → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Non-demolition readout
measuring qubit $a_0$ must not disturb neighbouring data qubits, which is hard when readout involves a strong microwave tone. - **Fast reset** — returning the ancilla to $|0\rangle$ in well under $T_1$. - **Low-latency classical control** — the decision path from detector to gate must complete withi → Case Study: Mid-Circuit Measurement and the Deferred Measurement Principle

O

Observable
A physical quantity that can be measured, represented by a Hermitian operator. Measurement outcomes are eigenvalues of the observable. → Glossary of Quantum Computing Terms
Observed
local realism excluded | | $2.83$ | Tsirelson bound — perfect entanglement, noiseless measurement | → Case Study: Running a CHSH Test on Real Hardware
optical tweezers
which create a dipole potential via the AC Stark shift: → Chapter 28: Photonic, Neutral Atom, and Other Approaches: The Diversity of Quantum Hardware and Why No One Has Won Yet
optimal control
shaping the laser pulse amplitude and phase to minimize the total error. Techniques like GRAPE (Gradient Ascent Pulse Engineering) and CRAB (Chopped Random Basis) optimize the pulse waveform to maximize gate fidelity under constraints (laser power, bandwidth, duration). → Chapter 28: Photonic, Neutral Atom, and Other Approaches: The Diversity of Quantum Hardware and Why No One Has Won Yet
Optimistic scenario (2030-2035):
First logical qubits with error rates below physical qubit error rates - 100-1,000 logical qubits - First demonstrations of quantum advantage for practical problems (chemistry, optimization) → Chapter 32: Quantum Hype vs. Quantum Reality
Oracle
A black-box subroutine in query-complexity algorithms. Quantum algorithms are often analyzed by how many oracle queries they require compared to classical algorithms. → Glossary of Quantum Computing Terms
Other key properties:
$H = \frac{1}{\sqrt{2}}(X + Z)$ (up to normalization) - $HXH = Z$ and $HZH = X$ (H interchanges X and Z) - $H = R_y(\pi/4) \cdot R_z(\pi) \cdot R_y(\pi/4)$... wait, let me be more precise: - $H = e^{i\pi/2} R_y(\pi/2) \cdot R_z(\pi)$... actually, the decomposition is simpler: $H = R_z(\pi) \cdot R_y → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Outer Product
The product |ψ⟩⟨φ|, which produces a matrix (operator) from two vectors. Projectors are outer products of a state with itself. → Glossary of Quantum Computing Terms
over 1,500 bytes
and that crosses a boundary that matters. → Case Study: Migrating a TLS Stack to Post-Quantum Cryptography

P

Pair it with a depth-stressing benchmark
repeated identity circuits, or a mirror circuit — to characterize coherence separately. 4. **Report the fitted rates, not the raw success probability.** "BV succeeded 91% at $n=4$" is not portable; "$\epsilon_{2q} = 0.0071$" is. 5. **Use the fitted model to predict** a different circuit's fidelity, → Case Study: Bernstein-Vazirani as a System Benchmark
parity checks
linear functions of the received bits that are zero for valid codewords. → Chapter 23: Classical Error Correction Review: Repetition Codes, Hamming Codes, and Why Quantum Is Harder (No-Cloning Theorem)
Pauli Gates
The three fundamental single-qubit gates: X (bit flip), Y (bit-and-phase flip), Z (phase flip). Together with the identity I, they form the Pauli group. → Glossary of Quantum Computing Terms
Pauli String
A tensor product of Pauli operators acting on different qubits, e.g., X⊗Z⊗I. Any Hamiltonian can be decomposed into a sum of Pauli strings. → Glossary of Quantum Computing Terms
period finding
which quantum computers can solve efficiently. → Chapter 1: Why Quantum Computing? What Quantum Computers Can Do That Classical Computers Can't (and What They Can't Do Better)
Pessimistic scenario (2045+):
Fundamental obstacles to scaling (e.g., correlated errors, materials limitations) - Error correction overhead larger than anticipated - "Quantum winter" delays investment and progress → Chapter 32: Quantum Hype vs. Quantum Reality
Phase Estimation
A quantum algorithm that estimates the eigenvalue (phase) of a unitary operator. A key subroutine in Shor's algorithm, HHL, and quantum simulation. → Glossary of Quantum Computing Terms
photons don't interact with each other
nonlinearity must be manufactured. → Key Takeaways: Chapter 28 — Photonic, Neutral Atom, and Other Approaches: The Diversity of Quantum Hardware and Why No One Has Won Yet
Physical mechanisms of pure dephasing ($T_\phi$):
**Charge noise:** Fluctuating electric fields shift the qubit frequency. For transmon qubits, the charge dispersion (dependence of frequency on charge) couples charge noise to dephasing. - **Flux noise:** Magnetic flux fluctuations shift the frequency of flux-tunable qubits. This is the dominant dep → Chapter 22: Why Quantum Error Correction Is Necessary: Decoherence, Gate Errors, and the Fragility of Quantum Information
Physical mechanisms:
**Superconducting qubits:** Energy relaxation via spontaneous emission of microwave photons through the coupling capacitor. The quality factor $Q$ of the resonator and the Purcell effect determine $T_1$. - **Trapped ions:** Spontaneous emission of optical photons from the excited electronic state. $ → Chapter 22: Why Quantum Error Correction Is Necessary: Decoherence, Gate Errors, and the Fragility of Quantum Information
Physical Qubit
An actual qubit implemented in hardware (superconducting circuit, trapped ion, etc.), as opposed to a logical (error-corrected) qubit. → Glossary of Quantum Computing Terms
physically moving qubits during a computation
turned out to be exactly what high-rate quantum LDPC codes require. This case study explains that convergence, quantifies what it buys, and identifies what still stands in the way. → Case Study: Why Neutral Atoms Suddenly Matter
Post-Quantum Cryptography (PQC)
Cryptographic algorithms designed to be secure against attacks by both classical and quantum computers. NIST standardized the first PQC algorithms in 2024. → Glossary of Quantum Computing Terms
POVM (Positive Operator-Valued Measure)
A generalized quantum measurement formalism that can describe measurements more general than projective measurements. → Glossary of Quantum Computing Terms
Pre-shared symmetric keys
secure, but requires manual key distribution to every endpoint, the very problem QKD claims to solve. It also does not scale. - **Digital signatures** — which must be quantum-resistant, i.e. **ML-DSA**. Post-quantum cryptography. → Case Study: Evaluating a QKD Procurement Proposal
Pricing Models:
**Pay-per-shot:** Charged per circuit execution (typical: $0.30-$3.00 per task) - **Pay-per-second:** Charged for quantum processing unit (QPU) time - **Subscription:** Monthly access with included credits (IBM Quantum: free tier with 10 minutes/month) - **Reserved access:** Dedicated time slots for → Chapter 31: The Quantum Computing Industry
Projective Measurement
A measurement described by a set of orthogonal projectors. The standard von Neumann measurement model. → Glossary of Quantum Computing Terms
Properties of amplitude damping:
**Non-unital:** $\mathcal{E}_{\text{AD}}(I/2) \neq I/2$. The channel drives the state toward $|0\rangle\langle 0|$, shrinking the Bloch sphere asymmetrically. - **Irreversible:** Unlike depolarizing, the information leaked to the environment cannot be recovered without access to the bath. - **Physic → Chapter 22: Why Quantum Error Correction Is Necessary: Decoherence, Gate Errors, and the Fragility of Quantum Information
Properties of S:
$S^\dagger = S^3$ (inverse is $S^\dagger = S^{-1} = S^3$) - $S^2 = Z$ - $S^\dagger H S = H$ only if... let me compute: $S|0\rangle = |0\rangle$, $S|1\rangle = i|1\rangle$ → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Properties of T:
$T^\dagger = T^7$ (in the group, $T^8 = I$ up to global phase) - $T^2 = S$ - $T^4 = Z$ → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Properties of the depolarizing channel:
**Unital:** $\mathcal{E}_{\text{dep}}(I) = I$. The maximally mixed state is a fixed point. - **Isotropic:** All directions on the Bloch sphere are treated equally. The Bloch vector is uniformly shrunk by a factor of $(1 - 4p/3)$. - **Pauli-twirled:** Any single-qubit channel can be converted to a de → Chapter 22: Why Quantum Error Correction Is Necessary: Decoherence, Gate Errors, and the Fragility of Quantum Information
Properties:
$X^2 = I$ (self-inverse) - $X = X^\dagger$ (Hermitian) - $\det(X) = -1$ - Eigenvalues: $+1$ with eigenvector $|+\rangle$, $-1$ with eigenvector $|-\rangle$ → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Pure State
A quantum state that can be described by a single state vector |ψ⟩, as opposed to a mixed state (density matrix). → Glossary of Quantum Computing Terms

Q

QAOA (Quantum Approximate Optimization Algorithm)
A variational quantum algorithm for combinatorial optimization, alternating between cost Hamiltonian and mixer Hamiltonian evolution. → Glossary of Quantum Computing Terms
Qiskit
IBM's open-source quantum computing SDK. Provides tools for circuit construction, simulation, and execution on real quantum hardware. → Glossary of Quantum Computing Terms
QKD (Quantum Key Distribution)
Cryptographic protocols that use quantum mechanics to establish a shared secret key between two parties, with information-theoretic security against eavesdropping. → Glossary of Quantum Computing Terms
QMA (Quantum Merlin-Arthur)
The quantum analog of NP. Problems whose solutions can be verified efficiently by a quantum computer given a quantum witness. → Glossary of Quantum Computing Terms
Quantum Advantage
The demonstration that a quantum computer can solve a problem faster than any known classical algorithm. Also called "quantum supremacy" (though the term is controversial). → Glossary of Quantum Computing Terms
Quantum advantage is problem-specific
there is no single "best" platform for all applications. → Chapter 27: Trapped Ion Qubits: Individual Atoms Manipulated by Lasers — IonQ, Quantinuum, and the Highest-Fidelity Qubits
Quantum Annealing
A metaheuristic for solving optimization problems using quantum fluctuations to escape local minima. Implemented by D-Wave systems. → Glossary of Quantum Computing Terms
Quantum Channel
A completely positive, trace-preserving map that describes the evolution of a quantum system, including noise. → Glossary of Quantum Computing Terms
Quantum computing is not magic
it is linear algebra in complex vector spaces, with specific physical implementations. The speedups come from exploiting superposition, entanglement, and interference. → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
Quantum data
states from simulators, sensors, experiments, or other quantum processes. No loading cost; classical description is exponentially expensive; proven separations exist. Prognosis: the most defensible near-to-medium-term application of learning methods on quantum hardware. → Case Study: Learning on Quantum Data — Where QML's Argument Is Strongest
Quantum Fourier Transform (QFT)
The quantum analog of the discrete Fourier transform. Computes the Fourier transform of a quantum state's amplitudes in O(n²) gates for n qubits. → Glossary of Quantum Computing Terms
quantum interconnects
links that transfer quantum states between chips with high fidelity. Approaches include: → Chapter 26: Superconducting Qubits: Transmons, Flux Qubits, and the Hardware Inside IBM and Google Quantum Computers
Quantum Internet
A proposed network that distributes quantum entanglement between distant nodes, enabling secure communication, distributed quantum computing, and quantum sensor networks. → Glossary of Quantum Computing Terms
Quantum is linear algebra
the atom choice determines the qubit quality, and alkaline-earth atoms provide naturally decoupled nuclear spin qubits. → Key Takeaways: Chapter 28 — Photonic, Neutral Atom, and Other Approaches: The Diversity of Quantum Hardware and Why No One Has Won Yet
Quantum is linear algebra, not magic
the qubit properties are determined by nature, not by lithographic fabrication. → Key Takeaways: Chapter 27 — Trapped Ion Qubits: Individual Atoms Manipulated by Lasers — IonQ, Quantinuum, and the Highest-Fidelity Qubits
quantum memory
the ability to store qubits for long enough to perform entanglement swapping and purification. Current quantum memories have: → Chapter 10: Superdense Coding, Quantum Key Distribution, and the Communication Applications of Entanglement
quantum process tomography
the complete characterization of a quantum operation. But for quick verification, we can use simpler methods: → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Quantum Repeater
A device that extends the range of entanglement distribution by performing entanglement swapping and purification at intermediate nodes. → Glossary of Quantum Computing Terms
Quantum Supremacy
See Quantum Advantage. → Glossary of Quantum Computing Terms
Quantum Teleportation
A protocol that transfers an unknown quantum state from one qubit to another using entanglement and classical communication, without physically moving the qubit. → Glossary of Quantum Computing Terms
Quantum Volume
A hardware-agnostic metric for quantum computer performance, combining qubit count, connectivity, gate fidelity, and circuit depth. → Glossary of Quantum Computing Terms
Quantum Walk
The quantum analog of a classical random walk. Quantum walks spread faster (ballistic vs. diffusive) and are used in quantum search and graph algorithms. → Glossary of Quantum Computing Terms
quantum-inspired classical algorithms
classical algorithms that borrow ideas from quantum computing to achieve speedups on classical hardware. These algorithms demonstrate that some of the insights from quantum computing can be applied classically, reducing the gap between quantum and classical performance. → Chapter 32: Quantum Hype vs. Quantum Reality
Qubit
The fundamental unit of quantum information. A two-level quantum system that can exist in superpositions of |0⟩ and |1⟩. → Glossary of Quantum Computing Terms
Qubit calibration
Rabi, Ramsey, $T_1$, Hahn echo, and randomized benchmarking — is essential for maintaining high-fidelity operation and must be repeated periodically to track parameter drift. TLS fluctuations and quasiparticle events cause qubit frequencies to drift on timescales of minutes to hours. → Key Takeaways: Chapter 29 — Quantum Computing Systems: Cryogenics, Control Electronics, Calibration, and What It Takes to Run a Quantum Computer
Qubit wires
horizontal lines representing individual qubits, read left to right in time 2. **Quantum gates** — symbols placed on wires representing unitary operations 3. **Measurements** — terminal operations that project qubits onto the computational basis → Chapter 7: Quantum Circuits: Building Computations from Gates — Universal Gate Sets, Circuit Diagrams, and Circuit Depth
QubitWorks
45 employees, $28M raised, a modality they describe as "hybrid spin-photonic." Claims: 64 qubits, 99.4% two-qubit fidelity, 10,000 qubits by 2031, three paying customers. → Case Study: Technical Due Diligence on a Quantum Startup

R

Random circuit sampling
demonstrated by Google (Sycamore, Willow) and USTC (Zuchongzhi) 2. **Gaussian boson sampling** — demonstrated by Xanadu (Borealis) 3. **Small-molecule VQE** — H$_2$, LiH, H$_2$O, small metal complexes 4. **Small-scale QAOA** — MaxCut on ~20-node graphs 5. **Error mitigation experiments** — zero-nois → Chapter 32: Quantum Hype vs. Quantum Reality
Raw counts always
a reader must be able to recompute every derived number. → Case Study: Assembling the Portfolio into a Reproducible Report
Realistic near-term targets:
**Small molecule ground state energies** (H$_2$, LiH, H$_2$O, N$_2$) — already demonstrated on NISQ devices using VQE - **Catalyst reaction mechanisms** — understanding transition states for industrially important reactions (e.g., nitrogen fixation, carbon capture) - **Materials with strong electron → Chapter 32: Quantum Hype vs. Quantum Reality
Recalibrate the Q14–Q15 gate at the new frequency
result: $7.0\times10^{-3}$, back to normal. → Case Study: Diagnosing a Qubit That Went Bad Overnight
Recent advances in TLS mitigation:
**Tantalum (Ta) qubits:** Replacing Al with Ta reduces TLS density by 10–100×, achieving $T_1 > 500\,\mu$s. - **Hydrogen annealing:** Baking at 400°C in forming gas ($\text{H}_2/\\text{N}_2$) removes surface oxides. - **Vacuum-gap capacitors:** Replacing dielectric capacitors with vacuum gaps reduce → Chapter 26: Superconducting Qubits: Transmons, Flux Qubits, and the Hardware Inside IBM and Google Quantum Computers
Recent progress in materials:
Tantalum-based transmons have demonstrated $T_1 > 500\,\mu$s (compared to ~200 $\mu$s for aluminum) - Surface cleaning with hydrofluoric acid has reduced TLS density by 10× - Vacuum-gap capacitors (replacing dielectric capacitors) reduce participation ratios → Chapter 26: Superconducting Qubits: Transmons, Flux Qubits, and the Hardware Inside IBM and Google Quantum Computers
Repeat for the $\sqrt{X}$ gate independently
do not assume it is exactly half, because pulse-shape nonlinearities break that assumption. 4. **Drift monitoring.** Superconducting qubits drift on hour timescales; re-run step 2 periodically. This is why cloud quantum backends publish a "last calibrated" timestamp, and why results taken hours apar → Case Study: Calibrating a Rotation Gate with a Rabi Sweep
RSA Encryption
The most widely used public-key cryptosystem, based on the difficulty of factoring large integers. Broken by Shor's algorithm on a sufficiently large quantum computer. → Glossary of Quantum Computing Terms
Run an application-proxy benchmark
a small instance of your actual algorithm — rather than trusting a synthetic score. 4. **Include mirror circuits or randomized benchmarking** to separate coherent from incoherent error. 5. **Repeat across calibration cycles** to capture drift (Chapter 8). 6. **Report the raw data**, so that others c → Case Study: Reading a Benchmark — Quantum Volume and Its Discontents
Rydberg Blockade
A phenomenon where exciting one neutral atom to a Rydberg state prevents nearby atoms from being excited, enabling fast two-qubit gates in neutral atom quantum computers. → Glossary of Quantum Computing Terms

S

Scaling challenges
frequency crowding, crosstalk, wiring density, and materials defects — are the primary obstacles to building large-scale fault-tolerant processors. 7. **The surface code** is the leading error correction architecture, requiring $\sim 3d^2$ physical qubits per logical qubit and a physical error rate → Key Takeaways: Chapter 26 — Superconducting Qubits: Transmons, Flux Qubits, and the Hardware Inside IBM and Google Quantum Computers
shared motional modes
collective vibrations of all the ions. An $N$-ion chain has $N$ axial modes. → Case Study: Scaling a Trapped-Ion Machine — QCCD and Its Costs
Shor Code
The first quantum error-correcting code, encoding one logical qubit in nine physical qubits. Protects against arbitrary single-qubit errors. → Glossary of Quantum Computing Terms
Shor's Algorithm
A quantum algorithm that factors integers in polynomial time, providing exponential speedup over the best known classical algorithms. Breaks RSA encryption. → Glossary of Quantum Computing Terms
Shot noise (#5)
the dominant problem. 1,024 shots gives gradient SNR of 0.045; the optimizer was performing a random walk. 2. **Local minimum (#3)** — random initialization lands in the −7.42 basin 35% of the time even noiselessly. 3. **Hardware noise (#6)** — 360 mHa upward bias, mostly recoverable by mitigation. → Case Study: Diagnosing a VQE That Won't Converge
Shuttle
transport an ion between zones by ramping electrode voltages. - **Split / merge** — divide a chain or combine two. - **Swap** — physically reorder ions within a chain. → Case Study: Scaling a Trapped-Ion Machine — QCCD and Its Costs
Skills applied
Distinguishing a *sampling* task from a *decision* or *optimization* task (§1.3, §1.4). - Identifying which complexity class a claimed speedup would actually live in (§1.3). - Recognizing the "best known classical algorithm" moving target (§1.6). - Separating physical qubits from logical qubits (§1. → Case Study: Auditing a Quantum Advantage Claim
Small search spaces inside larger algorithms
amplitude amplification as a subroutine, boosting a heuristic's success probability from $p$ to near 1 in $O(1/\sqrt p)$ rounds. - **Constraint satisfaction with cheap predicates**, where the oracle is a handful of clauses rather than a block cipher. - **Quantum counting / mean estimation**, where t → Case Study: Costing Grover Against AES-128
Software update signing keys
if compromised retroactively, every device that ever trusted that key is vulnerable - **Blockchain and cryptocurrency** — transactions signed with ECDSA today could be forged tomorrow → Chapter 30: Quantum Cryptography and Post-Quantum Security
Solovay-Kitaev Theorem
Any unitary gate can be approximated to precision ε using O(log^c(1/ε)) gates from a universal gate set. Guarantees efficient gate compilation. → Glossary of Quantum Computing Terms
spectral theorem
the operator is a weighted sum of projectors onto its eigenstates. This decomposition is central to understanding measurement in quantum mechanics: measuring an observable projects the state onto one of the operator's eigenstates, yielding the corresponding eigenvalue as the measurement outcome. → Chapter 3: The Mathematics of Quantum Computing: State Vectors, Bra-Ket Notation, Unitary Operators, and the Linear Algebra You Need
Spread
$H^{\otimes n}$ creates the uniform superposition. 2. **Kick back** — the oracle writes $f$'s structure into the phases. 3. **Interfere** — $H^{\otimes n}$ converts that phase pattern into a single basis state. → Case Study: Phase Kickback as the Universal Mechanism
Stabilizer Formalism
A mathematical framework for describing quantum error-correcting codes using the Pauli group. A code is defined by its stabilizer generators. → Glossary of Quantum Computing Terms
State Vector
A vector |ψ⟩ in Hilbert space that completely describes a pure quantum state. → Glossary of Quantum Computing Terms
Statistical
shot noise, shrinks as $1/\sqrt N$, and is fully under your control: → Case Study: Building a Reproducible Quantum Experiment Harness
Steane Code
A 7-qubit CSS quantum error-correcting code that encodes one logical qubit and corrects arbitrary single-qubit errors. → Glossary of Quantum Computing Terms
Step 5 — Measure the first qubit:
If $f$ is constant ($f(0) = f(1)$): the coefficient of $|1\rangle$ is zero. We measure $|0\rangle$ with probability 1. - If $f$ is balanced ($f(0) \neq f(1)$): the coefficient of $|0\rangle$ is zero. We measure $|1\rangle$ with probability 1. → Chapter 11: Quantum Parallelism and Interference — How Quantum Algorithms Get Their Speedup
Superconducting Qubit
A qubit implemented using superconducting circuits with Josephson junctions. Used by IBM, Google, and Rigetti. → Glossary of Quantum Computing Terms
Superdense Coding
A protocol that transmits two classical bits by sending a single qubit, using pre-shared entanglement. → Glossary of Quantum Computing Terms
Superposition
A quantum state that is a linear combination of basis states: |ψ⟩ = α|0⟩ + β|1⟩. The qubit is in both states simultaneously until measured. → Glossary of Quantum Computing Terms
Surface Code
A topological quantum error-correcting code defined on a 2D lattice. The leading candidate for fault-tolerant quantum computation due to its high error threshold (~1%). → Glossary of Quantum Computing Terms
SWAPs inserted for routing
35% of the entangling budget spent moving qubits, not computing. → Case Study: Fitting a Circuit Inside the Coherence Budget
symmetric
it doesn't matter which qubit is "control" and which is "target." → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
syndromes
parity checks that reveal information about which error occurred, without revealing anything about the encoded state. → Chapter 22: Why Quantum Error Correction Is Necessary: Decoherence, Gate Errors, and the Fragility of Quantum Information
Systematic
readout bias, coherent gate errors, drift. Does *not* shrink with more shots. Estimate it by repeating the identical experiment across several calibration cycles and taking the spread of the means. → Case Study: Building a Reproducible Quantum Experiment Harness

T

Tensor Product
The mathematical operation (⊗) that combines the state spaces of individual quantum systems into the state space of the composite system. → Glossary of Quantum Computing Terms
The algorithm has no interference step
no final Hadamard layer, no diffusion, no QFT. If nothing converts phases into amplitudes, there is no algorithm. 2. **Success depends on a postselection outcome** with probability that shrinks exponentially in problem size. 3. **The claimed speedup is stated in oracle calls only**, ignoring the num → Case Study: The Algorithm That Wasn't — Superposition Without Interference
The math IS the physics IS the computation
in quantum computing, the linear algebra directly describes the physical reality and the computation. There is no separation. → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
The QFT is not a standalone speedup
it is a subroutine. Its exponential compactness (representing $2^n$ Fourier coefficients in $n$ qubits) is harnessed by algorithms that extract global properties (period, phase, eigenvalue) from the Fourier-transformed state. → Key Takeaways: Chapter 14 — The Quantum Fourier Transform — The Mathematical Engine Inside the Most Important Quantum Algorithms
The quantum chip is roughly 7% of the capital cost
an inversion of the intuition that the qubits are the expensive part. → Case Study: What It Costs to Run One Quantum Computer for a Year
The research directions that address it:
**Classical shadows** and randomized measurement schemes, reducing the number of distinct settings. - **Better Hamiltonian factorizations** (low-rank, tensor hypercontraction) that shrink $\sum|c_k|$ — attacking the quantity that is squared. - **Abandoning VQE for QPE** at fault-tolerant scale, wher → Case Study: The Measurement Budget That Sinks VQE
Three baselines per row
ideal, noiseless-simulated, and hardware — because each answers a different question: is the algorithm right, is the implementation right, and how much did the device cost you. → Case Study: Assembling the Portfolio into a Reproducible Report
Threshold Theorem
If the physical error rate is below a certain threshold (~0.1-1% for surface codes), arbitrarily long quantum computations can be performed reliably using error correction. → Glossary of Quantum Computing Terms
Toffoli Gate (CCNOT)
A three-qubit gate that flips the target if both control qubits are |1⟩. Universal for classical reversible computation. → Glossary of Quantum Computing Terms
Topological Qubit
A qubit encoded in non-local topological degrees of freedom (e.g., Majorana zero modes), inherently protected against local noise. Microsoft's primary approach. → Glossary of Quantum Computing Terms
Transmon
A type of superconducting qubit designed to be insensitive to charge noise. The most widely used superconducting qubit design. → Glossary of Quantum Computing Terms
Transversal Gate
A fault-tolerant gate that operates on each physical qubit in a code block independently, preventing errors from spreading between qubits. → Glossary of Quantum Computing Terms
transversally
bitwise across the code block, so an error on one physical qubit cannot spread within the block. Transversal gates are the cheap, safe way to compute on encoded data. → Case Study: Teleportation as Architecture — Repeaters and Gate Teleportation
Trotterization (Trotter-Suzuki Decomposition)
A method for approximating the time evolution operator e^(-iHt) as a product of simpler operators, enabling Hamiltonian simulation on quantum computers. → Glossary of Quantum Computing Terms
Troubleshooting common installation issues:
**Version conflicts:** Use `pip install qiskit==1.0 qiskit-aer==0.14 qiskit-ibm-runtime==0.20` for a known-compatible set. - **Rust dependency:** `qiskit-aer` requires a Rust compiler on some platforms. On macOS, install Xcode command line tools (`xcode-select --install`). On Linux, install `build-e → Chapter 8: Programming Quantum Computers with Qiskit: Your First Quantum Program on a Real Quantum Processor
tunable couplers
a separate transmon with a SQUID loop whose frequency is flux-tunable — placed between qubits. By tuning the coupler frequency, the effective qubit–qubit coupling $g_{\text{eff}}$ can be turned on and off: → Chapter 26: Superconducting Qubits: Transmons, Flux Qubits, and the Hardware Inside IBM and Google Quantum Computers
twice
once forward, once to uncompute — plus the diffusion operator. → Case Study: Costing Grover Against AES-128
T₁ Time
The energy relaxation time of a qubit: how long it takes for an excited state |1⟩ to decay to the ground state |0⟩. → Glossary of Quantum Computing Terms
T₂ Time
The phase coherence time of a qubit: how long phase information is preserved before dephasing destroys it. T₂ ≤ 2T₁. → Glossary of Quantum Computing Terms

U

Unitary Operator
An operator U satisfying U†U = UU† = I. Quantum gates are unitary operators. Unitary evolution preserves the norm of the state vector. → Glossary of Quantum Computing Terms
universal for classical reversible computation
any classical Boolean function can be implemented with Toffoli gates. Together with the Hadamard, it is universal for quantum computation. → Chapter 6: Quantum Gates: Pauli (X, Y, Z), Hadamard, CNOT, Phase, Toffoli — The Building Blocks of Quantum Circuits
Universal Gate Set
A set of quantum gates that can approximate any unitary operation to arbitrary precision. Example: {H, T, CNOT}. → Glossary of Quantum Computing Terms
Use fault-tolerant extraction gadgets
Shor-style cat-state ancillas, or Steane/Knill extraction — that prevent a single ancilla fault from spreading to multiple data qubits. → Case Study: Implementing and Testing the Steane Code

V

Variational Quantum Algorithm
A hybrid classical-quantum algorithm where a classical optimizer tunes the parameters of a quantum circuit to minimize a cost function. Includes VQE and QAOA. → Glossary of Quantum Computing Terms
variational quantum algorithms
hybrid quantum-classical algorithms where the quantum computer prepares a parameterized state and measures an objective function, and a classical optimizer updates the parameters. → Chapter 1: Why Quantum Computing? What Quantum Computers Can Do That Classical Computers Can't (and What They Can't Do Better)
Verification for common states:
$|0\rangle$: $\alpha = 1, \beta = 0 \Rightarrow \vec{r} = (0, 0, 1)$ → north pole ✓ - $|1\rangle$: $\alpha = 0, \beta = 1 \Rightarrow \vec{r} = (0, 0, -1)$ → south pole ✓ - $|+\rangle$: $\alpha = \beta = 1/\sqrt{2} \Rightarrow r_x = 2\text{Re}(1/2) = 1, r_y = 0, r_z = 0$ → positive x ✓ - $|+i\rangle → Chapter 2: The Qubit: Superposition, the Bloch Sphere, and Why a Quantum Bit Is Fundamentally Different from a Classical Bit
Verification that all stabilizers commute:
Two $Z$-type stabilizers: They overlap in at most one qubit (e.g., $Z_2$ in $Z_1 Z_2$ and $Z_2 Z_3$). The product of their commutators is $Z_2 \cdot Z_2 = I$, so they commute. ✓ - Two $X$-type stabilizers: They overlap in qubits 4, 5, 6 (three qubits). The commutator of $X^{\otimes 6}$ with $X^{\oti → Chapter 24: Quantum Error Correcting Codes: The Shor Code, Steane Code, and Stabilizer Formalism
VQE (Variational Quantum Eigensolver)
A variational algorithm for finding the ground state energy of a Hamiltonian, with primary applications in quantum chemistry. → Glossary of Quantum Computing Terms

W

Wavefunction
The mathematical description of a quantum state. In quantum computing, the wavefunction is a state vector in a finite-dimensional Hilbert space. → Glossary of Quantum Computing Terms
We are at the beginning
the timeline to practical quantum advantage is uncertain, but the foundations you have built in this book will serve you regardless of how the technology evolves. → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
We're at the beginning
the architecture that ultimately wins may not have been invented yet. → Chapter 27: Trapped Ion Qubits: Individual Atoms Manipulated by Lasers — IonQ, Quantinuum, and the Highest-Fidelity Qubits
What each component does:
**qiskit (Terra):** The foundation. Provides the `QuantumCircuit` class, gate definitions, transpilation passes, and visualization tools. If you're building a circuit, you're using Terra. → Chapter 8: Programming Quantum Computers with Qiskit: Your First Quantum Program on a Real Quantum Processor
What's still far off:
Full protein folding or drug-target binding affinities (too many atoms) - Room-temperature superconductor design (requires understanding we don't yet have) - Battery electrolyte optimization (requires dynamics, not just statics) → Chapter 32: Quantum Hype vs. Quantum Reality
What's unlikely:
Beating classical solvers (Gurobi, CPLEX) on large-scale mixed-integer programs - Solving NP-hard problems to optimality at scale - Replacing classical optimization in production systems → Chapter 32: Quantum Hype vs. Quantum Reality
When do barren plateaus occur?
Deep, unstructured ansatzes (random circuits). - Global cost functions (measuring all qubits). - High entanglement between qubits. - Excessive expressiveness (the circuit forms a 2-design). → Chapter 21: Quantum Machine Learning — Variational Circuits, Quantum Kernels, and the Search for Quantum Advantage in ML
When to use each method:
**Method 1 (implicit):** Quick prototyping, tutorials, simple circuits. The registers are named `q` and `c` by default. - **Method 2 (explicit):** Production code, multi-register circuits, when you need named registers for clarity. - **Method 3 (dynamic):** When you need to build circuits incrementa → Chapter 8: Programming Quantum Computers with Qiskit: Your First Quantum Program on a Real Quantum Processor
Where QKD does make sense
and it is worth being fair about this: a small number of point-to-point links, under one operator's physical control, carrying secrets whose value justifies the cost, where information-theoretic key exchange is a *regulatory* requirement rather than an engineering one. Some national-security and int → Case Study: Evaluating a QKD Procurement Proposal
Where quantum likely won't help ML:
**Training large neural networks:** The data loading bottleneck (inputting classical data into a quantum state) negates most theoretical speedups. - **Replacing GPUs:** Classical hardware is advancing rapidly. Quantum processors are not competitive for matrix multiplication or gradient computation a → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
Where quantum may help ML:
**Quantum kernel methods:** Computing kernel functions that are classically intractable. Rigorous proofs of quantum advantage exist for specific problems (e.g., discrete logarithm-based kernels). - **Quantum sampling:** Generative models based on quantum circuit sampling (e.g., Born machines) may ha → Chapter 34: The Quantum Future: Fault Tolerance, Quantum Networks, Quantum Internet, and What Comes After NISQ
Why these stabilizers work:
The $Z$-type stabilizers within each block detect $X$ errors (bit flips) within that block. This is exactly the bit-flip repetition code applied to each 3-qubit block. - The $X$-type stabilizers across blocks detect $Z$ errors (phase flips). A $Z$ error on any qubit in a block flips the sign of that → Chapter 24: Quantum Error Correcting Codes: The Shor Code, Steane Code, and Stabilizer Formalism
Winner: qLDPC codes
which is precisely why the recent qLDPC results have driven so much interest in neutral-atom and shuttling-based architectures. → Case Study: Choosing a Code for a Given Hardware Architecture

Y

You understand noise
you predicted fidelity from gate counts and error rates, and your predictions match. 4. **You report honestly** — raw counts, both error components, explicit scope, full provenance. 5. **You can verify** — every claim has an independent check. → Case Study: Assembling the Portfolio into a Reproducible Report

Z

Zero-Noise Extrapolation
An error mitigation technique that runs a circuit at multiple noise levels and extrapolates to the zero-noise limit. → Glossary of Quantum Computing Terms