Glossary of Quantum Computing Terms

A

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.

Amplitude Amplification — A technique that boosts the probability amplitude of desired measurement outcomes, generalizing Grover's algorithm.

Ancilla Qubit — An auxiliary qubit used in a quantum computation, typically for temporary storage or to enable a specific gate operation.

Ansatz — A parameterized trial wavefunction used in variational quantum algorithms (VQE, QAOA). The choice of ansatz determines the expressiveness and trainability of the circuit.

Anyon — A quasiparticle in 2D systems with statistics between bosons and fermions. Relevant to topological quantum computing and surface code error syndromes.

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.

Basis — A set of orthonormal vectors that span a vector space. The computational basis for qubits is {|0⟩, |1⟩}.

BB84 — The first quantum key distribution protocol, proposed by Bennett and Brassard in 1984. Uses polarized photons to establish a shared secret key.

Bell State — A maximally entangled two-qubit state. The four Bell states are |Φ⁺⟩, |Φ⁻⟩, |Ψ⁺⟩, |Ψ⁻⟩.

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.

Bernstein-Vazirani Algorithm — A quantum algorithm that learns a hidden bit string in a single oracle query, demonstrating exponential quantum advantage over classical algorithms.

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.

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|ψ⟩|².

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.

Bra-Ket Notation — Dirac notation for quantum states: |ψ⟩ (ket) represents a column vector; ⟨ψ| (bra) represents its conjugate transpose (row vector). ⟨φ|ψ⟩ is the inner product.

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.

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.

C

Circuit Depth — The number of sequential layers of gates in a quantum circuit. Deeper circuits are more susceptible to decoherence.

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.

Classical Shadow — A technique for efficiently estimating many properties of a quantum state from a small number of measurements, using randomized measurement protocols.

CNOT (Controlled-NOT) — A two-qubit gate that flips the target qubit if the control qubit is |1⟩. Essential for creating entanglement.

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.

Collapse Postulate — Upon measurement, a quantum state "collapses" to the eigenstate corresponding to the measurement outcome. The original superposition is irreversibly destroyed.

Computational Basis — The standard basis {|0⟩, |1⟩} for a single qubit, extended via tensor products for multiple qubits.

Controlled Gate — A gate that applies an operation to target qubit(s) only when control qubit(s) are in a specific state (typically |1⟩).

Cooper Pair — A bound pair of electrons in a superconductor, responsible for superconductivity. Josephson junctions exploit Cooper pair tunneling to create superconducting qubits.

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.

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.

D

Decoherence — The loss of quantum coherence due to unwanted interactions with the environment. The primary obstacle to building large-scale quantum computers.

Deutsch-Jozsa Algorithm — A quantum algorithm that determines whether a function is constant or balanced in a single query, demonstrating exponential quantum advantage.

Dirac Notation — See Bra-Ket Notation.

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.

D-Wave — A company that builds quantum annealers, specialized quantum computers that solve optimization problems using adiabatic quantum computing principles.

E

E91 Protocol — A quantum key distribution protocol proposed by Ekert in 1991, using Bell's inequality to detect eavesdropping.

Eigenvalue / Eigenvector — For an operator A, an eigenvector |v⟩ satisfies A|v⟩ = λ|v⟩, where λ is the eigenvalue. Measurement outcomes are eigenvalues of the observable.

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.

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.

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.

Error Syndrome — The pattern of stabilizer measurement outcomes that identifies which error occurred, without revealing the encoded quantum information.

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.

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.

Fredkin Gate (CSWAP) — A three-qubit gate that swaps two target qubits if the control qubit is |1⟩. Universal for classical reversible computation.

G

Gate Decomposition — Expressing a complex quantum gate as a sequence of simpler gates from a universal gate set.

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.

H

Hadamard Gate (H) — A single-qubit gate that creates equal superposition: H|0⟩ = (|0⟩ + |1⟩)/√2, H|1⟩ = (|0⟩ − |1⟩)/√2.

Hamiltonian — The operator representing the total energy of a quantum system. Time evolution is governed by the Hamiltonian via the Schrödinger equation.

Hardware-Efficient Ansatz — A variational circuit design using gates native to the specific quantum hardware, minimizing the need for gate decomposition.

Hermitian Operator — An operator equal to its own conjugate transpose (A = A†). Observables in quantum mechanics are represented by Hermitian operators, guaranteeing real eigenvalues.

HHL Algorithm — A quantum algorithm for solving linear systems of equations, proposed by Harrow, Hassidim, and Lloyd. Offers exponential speedup under certain conditions.

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.

I

Inner Product — A bilinear operation ⟨φ|ψ⟩ that measures the overlap between two quantum states. The squared magnitude gives the probability of distinguishing them.

Interference — The constructive or destructive combination of probability amplitudes. Quantum algorithms use interference to amplify correct answers and cancel wrong ones.

Ion Trap — A device that confines charged atoms (ions) using electromagnetic fields. Trapped ions serve as high-fidelity qubits manipulated by lasers.

Ising Model — A mathematical model of ferromagnetism, also used to encode combinatorial optimization problems for quantum computers (QAOA, quantum annealing).

J

Jordan-Wigner Transformation — A mapping from fermionic creation/annihilation operators to Pauli operators on qubits, enabling quantum simulation of fermionic systems.

Josephson Junction — A weak link between two superconductors. The nonlinear inductance of Josephson junctions creates the anharmonicity needed for superconducting qubits.

K

Ket — See Bra-Ket Notation.

Knill-Laflamme Conditions — Necessary and sufficient conditions for a quantum code to correct a given set of errors.

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.

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).

Logical Qubit — An error-corrected qubit encoded across multiple physical qubits. Logical qubits have much lower effective error rates than physical qubits.

M

Magic State Distillation — A procedure for creating high-fidelity "magic states" from noisy ones, enabling non-Clifford gates in fault-tolerant quantum computation.

MaxCut — A combinatorial optimization problem: partition a graph's vertices to maximize the number of edges between partitions. A canonical benchmark for QAOA.

Measurement — The process of extracting classical information from a quantum state. Measurement is probabilistic (Born rule) and destructive (collapse).

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.

Mølmer-Sørensen Gate — A two-qubit entangling gate for trapped ions, using bichromatic laser fields to create a state-dependent force.

N

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.

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.

Noise Channel — A mathematical model of how quantum information degrades. Common channels: bit-flip, phase-flip, amplitude damping, depolarizing.

O

Observable — A physical quantity that can be measured, represented by a Hermitian operator. Measurement outcomes are eigenvalues of the observable.

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.

Outer Product — The product |ψ⟩⟨φ|, which produces a matrix (operator) from two vectors. Projectors are outer products of a state with itself.

P

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.

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.

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.

Physical Qubit — An actual qubit implemented in hardware (superconducting circuit, trapped ion, etc.), as opposed to a logical (error-corrected) qubit.

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.

POVM (Positive Operator-Valued Measure) — A generalized quantum measurement formalism that can describe measurements more general than projective measurements.

Projective Measurement — A measurement described by a set of orthogonal projectors. The standard von Neumann measurement model.

Pure State — A quantum state that can be described by a single state vector |ψ⟩, as opposed to a mixed state (density matrix).

Q

QAOA (Quantum Approximate Optimization Algorithm) — A variational quantum algorithm for combinatorial optimization, alternating between cost Hamiltonian and mixer Hamiltonian evolution.

Qiskit — IBM's open-source quantum computing SDK. Provides tools for circuit construction, simulation, and execution on real quantum hardware.

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.

QMA (Quantum Merlin-Arthur) — The quantum analog of NP. Problems whose solutions can be verified efficiently by a quantum computer given a quantum witness.

Qubit — The fundamental unit of quantum information. A two-level quantum system that can exist in superpositions of |0⟩ and |1⟩.

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).

Quantum Annealing — A metaheuristic for solving optimization problems using quantum fluctuations to escape local minima. Implemented by D-Wave systems.

Quantum Channel — A completely positive, trace-preserving map that describes the evolution of a quantum system, including noise.

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.

Quantum Internet — A proposed network that distributes quantum entanglement between distant nodes, enabling secure communication, distributed quantum computing, and quantum sensor networks.

Quantum Repeater — A device that extends the range of entanglement distribution by performing entanglement swapping and purification at intermediate nodes.

Quantum Supremacy — See Quantum Advantage.

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.

Quantum Volume — A hardware-agnostic metric for quantum computer performance, combining qubit count, connectivity, gate fidelity, and circuit depth.

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.

R

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.

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.

S

Shor's Algorithm — A quantum algorithm that factors integers in polynomial time, providing exponential speedup over the best known classical algorithms. Breaks RSA encryption.

Shor Code — The first quantum error-correcting code, encoding one logical qubit in nine physical qubits. Protects against arbitrary single-qubit errors.

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.

Stabilizer Formalism — A mathematical framework for describing quantum error-correcting codes using the Pauli group. A code is defined by its stabilizer generators.

State Vector — A vector |ψ⟩ in Hilbert space that completely describes a pure quantum state.

Steane Code — A 7-qubit CSS quantum error-correcting code that encodes one logical qubit and corrects arbitrary single-qubit errors.

Superconducting Qubit — A qubit implemented using superconducting circuits with Josephson junctions. Used by IBM, Google, and Rigetti.

Superdense Coding — A protocol that transmits two classical bits by sending a single qubit, using pre-shared entanglement.

Superposition — A quantum state that is a linear combination of basis states: |ψ⟩ = α|0⟩ + β|1⟩. The qubit is in both states simultaneously until measured.

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%).

Syndrome — See Error Syndrome.

T

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⟩.

T₂ Time — The phase coherence time of a qubit: how long phase information is preserved before dephasing destroys it. T₂ ≤ 2T₁.

Tensor Product — The mathematical operation (⊗) that combines the state spaces of individual quantum systems into the state space of the composite system.

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.

Toffoli Gate (CCNOT) — A three-qubit gate that flips the target if both control qubits are |1⟩. Universal for classical reversible computation.

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.

Transmon — A type of superconducting qubit designed to be insensitive to charge noise. The most widely used superconducting qubit design.

Transversal Gate — A fault-tolerant gate that operates on each physical qubit in a code block independently, preventing errors from spreading between qubits.

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.

U

UCCSD (Unitary Coupled Cluster Singles and Doubles) — A chemistry-inspired ansatz for VQE, based on the coupled cluster method from quantum chemistry.

Unitary Operator — An operator U satisfying U†U = UU† = I. Quantum gates are unitary operators. Unitary evolution preserves the norm of the state vector.

Universal Gate Set — A set of quantum gates that can approximate any unitary operation to arbitrary precision. Example: {H, T, CNOT}.

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.

VQE (Variational Quantum Eigensolver) — A variational algorithm for finding the ground state energy of a Hamiltonian, with primary applications in quantum chemistry.

W

Wavefunction — The mathematical description of a quantum state. In quantum computing, the wavefunction is a state vector in a finite-dimensional Hilbert space.

Z

Zero-Noise Extrapolation — An error mitigation technique that runs a circuit at multiple noise levels and extrapolates to the zero-noise limit.