Quantum Concept Library

A basis state is one of a set of reference states — mutually orthogonal and normalized — from which every other quantum state can be built as a superposition.

The Bloch sphere is a geometrical representation of the pure state space of a single qubit, mapping every possible qubit state to a point on the surface of a unit sphere.

The Born rule states that the probability of obtaining a specific measurement outcome is the squared modulus of the corresponding probability amplitude: P(i) = |⟨i|ψ⟩|².

Collapse is the abrupt update of a quantum state upon measurement: the superposition is replaced by the single basis state corresponding to the observed outcome.

Bra-ket notation is the standard mathematical notation for quantum states, where |ψ⟩ (ket) represents a column vector and ⟨ψ| (bra) represents its conjugate transpose row vector.

The Hadamard gate (H) is a single-qubit gate that creates an equal superposition, mapping |0⟩ to (|0⟩+|1⟩)/√2 and |1⟩ to (|0⟩−|1⟩)/√2.

Quantum interference is the phenomenon where probability amplitudes combine like waves — reinforcing or canceling each other — and it is the mechanism quantum algorithms use to suppress wrong answers and amplify correct ones.

The Pauli-X gate is the quantum equivalent of a classical NOT gate, flipping |0⟩ to |1⟩ and |1⟩ to |0⟩, corresponding to a 180-degree rotation about the x-axis of the Bloch sphere.

The Pauli-Y gate performs a 180-degree rotation about the y-axis of the Bloch sphere, mapping |0⟩ to i|1⟩ and |1⟩ to -i|0⟩.

The Pauli-Z gate is the phase-flip gate that leaves |0⟩ unchanged and maps |1⟩ to -|1⟩, corresponding to a 180-degree rotation about the z-axis of the Bloch sphere.

Quantum measurement is the process of extracting classical information from a quantum system, which irreversibly collapses the quantum state into one of the measurement basis states.

A qubit (quantum bit) is the fundamental unit of quantum information, capable of existing in a superposition of the classical states 0 and 1.

Superposition is the quantum mechanical principle that allows a quantum system to exist in multiple states simultaneously until measured.

Bell states are the four maximally entangled two-qubit states that form an orthonormal basis for the two-qubit Hilbert space and are the fundamental resource for quantum information protocols.

The CNOT (Controlled-NOT) gate is a two-qubit gate that flips the target qubit if and only if the control qubit is |1⟩, serving as the fundamental entangling gate in quantum computing.

The Controlled-Z (CZ) gate applies a phase flip to the |11⟩ state. It is symmetric: either qubit can be considered the control.

Decoherence is the process by which a quantum system loses its quantum coherence through interaction with its environment, causing superpositions to decay into classical statistical mixtures.

The no-cloning theorem states that it is impossible to create an identical copy of an arbitrary unknown quantum state, a fundamental limitation arising from the linearity of quantum mechanics.

The S gate (phase gate) applies a 90-degree phase rotation to |1⟩, mapping |1⟩ to i|1⟩ while leaving |0⟩ unchanged. It is the square root of the Z gate.

A probability amplitude is the complex number attached to each basis state in a quantum superposition; its squared magnitude gives the probability of measuring that outcome, and its phase enables interference.

Quantum entanglement is a correlation between quantum particles where the quantum state of the system cannot be described as a product of individual particle states, creating non-classical correlations that persist regardless of distance.

Quantum teleportation is a protocol that transfers an unknown quantum state from one qubit to another using shared entanglement and classical communication, without physically transmitting the qubit.

The Rx gate performs a rotation by angle theta about the x-axis of the Bloch sphere, enabling continuous single-qubit rotations.

The Ry gate performs a rotation by angle theta about the y-axis of the Bloch sphere, uniquely producing real-valued superpositions from basis states.

The Rz gate performs a rotation by angle theta about the z-axis of the Bloch sphere, applying a relative phase between |0⟩ and |1⟩.

Spectroscopy is the study of how matter absorbs and emits light at specific, quantized frequencies — a fingerprint that identifies atoms across light-years and locates a qubit's operating frequency in the lab.

The SWAP gate exchanges the quantum states of two qubits, implemented as three consecutive CNOT gates.

The T gate applies a pi/4 phase rotation to |1⟩, mapping |1⟩ to e^(i*pi/4)|1⟩. It is the square root of the S gate and essential for universal quantum computation.

The quantum computing stack is a four-layer abstraction — algorithm → circuit → pulse → hardware — in which each layer translates the commands of the layer above into its own language.

All quantum gates must be unitary transformations, satisfying U†U = I, ensuring reversibility and probability conservation.

Calibration is the continuous, sequential stack of experiments that tunes each qubit's control pulses; its data defines which gates exist on which qubits and is the QPU's source of truth.

The density matrix (or density operator) ρ is a mathematical representation of a quantum state that can describe both pure states and statistical mixtures of states.

The Deutsch-Jozsa algorithm determines whether a Boolean function is constant or balanced using only one query, providing an exponential speedup over classical deterministic algorithms.

The Fredkin gate (Controlled-SWAP) swaps two target qubits only when the control qubit is |1⟩.

Gate fidelity is the probability that the physical operation performed by the hardware matches the ideal logical gate it is supposed to implement.

The GHZ (Greenberger-Horne-Zeilinger) state is a maximally entangled multi-qubit state of the form (|000...0⟩+|111...1⟩)/sqrt(2) that demonstrates non-classical correlations stronger than Bell states.

Grover's algorithm provides a quadratic speedup for unstructured search, finding a marked item in an unsorted database of N items using only O(sqrt(N)) queries instead of O(N).

Hybrid quantum-classical computing combines a quantum processor with classical computation in one workflow, in three kinds of integration — remote, adjacent, and tight — with tight integration inside the coherence window as the ultimate goal.

A logical qubit is one protected qubit encoded across many error-prone physical qubits. In December 2024, Google's Willow chip showed for the first time that enlarging the code makes the logical qubit better, not worse — the first below-threshold surface code.

A microwave pulse is the physical waveform that implements a quantum gate on a superconducting qubit — a nanosecond-scale burst of shaped electromagnetic radiation, defined by five parameters and ultimately stored as two arrays of I and Q samples.

Mid-circuit measurement reads a qubit while the circuit is still running, enabling classically-controlled gates and dynamic circuits — the real if-statement of quantum computing.

ML-KEM (formerly CRYSTALS-Kyber) is a NIST-standardized post-quantum key encapsulation mechanism based on the Module Learning With Errors (MLWE) problem, designed to resist both classical and quantum attacks.

Native gates are the set of gates a quantum chip can directly execute — defined not by fixed chip physics but by today's calibration, and reachable from your circuit only through transpilation.

An oracle is a black-box subroutine, implemented as a unitary, that lets a quantum algorithm evaluate a function f(x) — including on inputs in superposition — while its internal workings are treated as unknown.

Phase kickback is the effect where applying a controlled operation to a target in an eigenstate leaves the target unchanged and instead imprints the eigenvalue's phase onto the control register.

Post-quantum migration is the worldwide transition of cryptography to quantum-resistant algorithms: NIST finalized FIPS 203/204/205 in August 2024, and US Executive Order 14412 (June 2026) sets federal deadlines — PQC encryption for sensitive systems by end of 2030.

OpenQASM is the human-readable 'assembly language' for quantum circuits, and QIR is an LLVM-based intermediate representation carrying quantum and classical logic together — as of 2026 the two converging standards of the quantum software stack.

QAOA is a hybrid quantum-classical algorithm for combinatorial optimization: it alternates parameterized cost and mixer layers on a quantum circuit while a classical optimizer tunes the parameters to maximize the expected solution quality.

The Quantum Fourier Transform (QFT) is the quantum analog of the discrete Fourier transform, transforming computational basis states into phase-encoded frequency states using only O(n^2) gates for n qubits.

Quantum Volume (QV) is a hardware-agnostic benchmark metric that measures the largest random circuit of equal width and depth that a quantum computer can successfully execute, capturing both qubit count and quality.

A quantum walk is the quantum analog of a classical random walk: the walker moves in superposition over positions, and interference between paths makes it spread quadratically faster (distance ~ t) than a classical walk (distance ~ sqrt(t)).

Qubit routing maps the logical qubits of a circuit onto a chip with limited connectivity, inserting SWAP gates to move states between non-adjacent qubits at the smallest possible cost in time and errors.

Rabi oscillation is the sinusoidal cycling of a qubit's population between |0⟩ and |1⟩ under a resonant drive: P₁(t) = sin²(Ωt/2). Its first peak defines the π-pulse — the calibrated NOT (X) gate.

T1 (energy relaxation time) and T2 (phase coherence time) are the two time constants that set how long a qubit survives: T1 measures how fast |1⟩ decays back to |0⟩, T2 how long a superposition keeps its phase.

The tensor product combines the state spaces of individual quantum systems into the state space of the composite system: two qubits live in the 4-dimensional space spanned by |00>, |01>, |10>, |11>, and n qubits in a 2^n-dimensional space.

The Toffoli gate (CCNOT) is a three-qubit gate that flips the target qubit only when both control qubits are |1⟩, serving as a universal gate for classical reversible computation.

The transmon is a superconducting qubit — a lithographically fabricated artificial atom whose Josephson junction makes it a weakly anharmonic, charge-noise-insensitive multi-level system.

Transpilation rewrites a quantum circuit into the native gate set a chip actually supports; routing maps logical qubits onto physical qubits under limited connectivity, inserting SWAP gates where direct connections are missing.

VQE is a hybrid quantum-classical algorithm that finds the ground state energy of a Hamiltonian by optimizing parameterized quantum circuits, designed for noisy near-term quantum computers.

Anharmonicity is the deviation of an oscillator's energy-level spacings from equality; in a transmon, α = ω12 − ω01 < 0 is the only spectral handle that separates the qubit transition from higher levels.

The Copenhagen interpretation, associated with the Bohr/Heisenberg lineage, treats measurement as a primitive of the theory: the wavefunction encodes probabilities via the Born rule, and upon measurement a single definite outcome is registered. It is one of several live interpretations that make identical predictions for standard quantum experiments.

Crosstalk is a control signal intended for one qubit causing unwanted evolution on another — an operation nobody asked for.

DRAG (Derivative Removal by Adiabatic Gate) is a pulse-shaping technique that adds the derivative of the main envelope as an orthogonal quadrature component, cancelling unwanted transitions to the leakage state |2⟩ in weakly anharmonic qubits like the transmon.

Fast (real-time) feedback closes the measure–decide–act loop inside the qubit's coherence window; FPGAs supply the deterministic, nanosecond-scale classical logic that makes this possible.

Leakage is the escape of quantum population out of the computational subspace {|0⟩, |1⟩} into higher levels such as |2⟩ — the price of short pulses whose wide spectra overlap the ω12 transition.

The Lindblad master equation is the equation of motion for an open quantum system: it extends Schrödinger dynamics with dissipator terms whose collapse operators L_k encode each noise channel (T1 relaxation, dephasing, leakage decay).

Magic states are special resource states that unlock universal fault-tolerant computation: most error-correcting codes can run Clifford gates safely but cannot run the T gate directly, so a prepared magic state is 'injected' via teleportation to perform it.

The Many-Worlds interpretation, originating with Everett's 1957 relative-state formulation, holds that the universal wavefunction always evolves unitarily -- there is no collapse; what looks like a single measurement outcome is one branch of an entangled superposition. It is one of several live interpretations that make identical predictions for standard quantum experiments.

Pulse optimization is the numerical sculpting of control waveforms by gradient descent on the gate infidelity C = 1 − F — from GRAPE's analytic gradients (2005) to modern differentiable open-system optimizers where the gradient flows through the noise itself.

Quantum low-density parity-check (qLDPC) codes protect many logical qubits with far fewer physical qubits than surface codes: IBM's bivariate-bicycle 'gross code' [[144,12,12]] stores 12 logical qubits in 288 physical qubits — matching surface-code performance with about 10x fewer qubits.

Quantum error correction (QEC) protects quantum information from decoherence and errors by encoding logical qubits into entangled states of multiple physical qubits, enabling fault-tolerant quantum computation.

Quantum phase estimation (QPE) estimates the eigenvalue phase of a unitary operator: given U and an eigenstate |u> with U|u> = e^(2*pi*i*phi)|u>, it extracts phi to a chosen precision using controlled-U operations and an inverse quantum Fourier transform.

Randomized Benchmarking (RB) measures average gate fidelity by running ever-longer random gate sequences that should return the qubit to |0⟩ and fitting the exponential decay of the survival probability.

Shor's algorithm factors large integers in polynomial time O((log N)^3), providing an exponential speedup over the best known classical algorithms and threatening RSA cryptography.

Solver cross-validation checks a numerical simulator against independently built implementations that differ in both method and codebase — because implementation errors are self-consistent and invisible from inside a single codebase.

A topological qubit is a proposed qubit that stores information nonlocally in topological properties of exotic quasiparticles (anyons), promising built-in error protection — but as of July 2026 there is no peer-reviewed demonstration of a working topological qubit.

Trotterization approximates continuous evolution under a sum of non-commuting generators A + B by alternating many tiny steps under A and B separately, with an error that shrinks predictably as the time slice Δt shrinks.