Quantum Computing Glossary

An auxiliary qubit used as a helper in quantum computations, often for error detection or phase kickback.

A geometric representation of all possible states of a single qubit as a point on a unit sphere.

One of four maximally entangled two-qubit states — the simplest example of quantum entanglement.

Controlled-NOT — a two-qubit gate that flips the target qubit when the control qubit is |1⟩.

The loss of quantum properties when a qubit interacts with its environment.

The total tolerable error accumulated across a circuit before results become unreliable.

A quantum correlation between two or more qubits where their states are linked regardless of distance.

Classical post-processing techniques that reduce the effect of hardware noise without full quantum error correction.

A measure (0 to 1) of how close an actual quantum operation or state is to the ideal target.

A quantum search algorithm that finds a marked item in an unsorted list quadratically faster than any classical algorithm.

The H gate — creates an equal superposition of |0⟩ and |1⟩ from a basis state.

A quantum-classical algorithm that uses a QPU for quantum subroutines and a classical computer for optimization and control.

An error-corrected qubit encoded across many physical qubits — the unit of computation in fault-tolerant quantum computers.

The act of observing a qubit's state, which collapses the superposition to a definite 0 or 1.

Noisy Intermediate-Scale Quantum — devices with 50–1000 qubits without full error correction.

The fundamental single-qubit gates X, Y, Z — forming the basis for all quantum operations.

Classical cryptographic algorithms designed to be secure against attacks from both classical and quantum computers.

The fundamental unit of quantum information — the quantum analog of a classical bit.

A unitary operation that transforms the state of one or more qubits.

A sequence of quantum gates applied to a register of qubits, followed by measurements.

Quantum Processing Unit — the physical hardware chip that executes quantum circuits.

Techniques to detect and correct errors in quantum circuits without measuring (and collapsing) the qubits.

Quantum Fourier Transform — the quantum analog of the discrete Fourier transform, exponentially faster.

Quantum Approximate Optimization Algorithm — a hybrid algorithm for combinatorial optimization problems.

IBM's single-number benchmark measuring the overall capability of a quantum computer, accounting for qubits, connectivity, and fidelity.

A demonstrated speedup or improvement where a quantum computer outperforms the best classical algorithm on a practical task.

IBM's term for quantum circuits that are too complex to simulate classically but can be executed on real QPUs.

A unit of work submitted to a quantum cloud service — one or more circuits to be run on a QPU or simulator.

A software engineer who writes quantum circuits and hybrid algorithms using quantum SDKs like Qiskit, PennyLane, or HLQuantum.

The ability of a quantum system to exist in multiple states at the same time.

A quantum algorithm for integer factorization with exponential speedup over the best known classical algorithms.

Statistical uncertainty in measurement results from running a quantum circuit a finite number of times.

The total number of circuit executions allocated for a quantum job — a practical resource limit.

The process of compiling a quantum circuit into the native gate set and qubit connectivity of a specific device.

T1 is the qubit energy relaxation time; T2 is the coherence (dephasing) time. Both limit circuit duration.

The three-qubit CCX gate — flips the target qubit only when both control qubits are |1⟩.

Variational Quantum Eigensolver — a hybrid quantum-classical algorithm for finding ground state energies.

A parameterized quantum circuit whose gate angles are tuned by a classical optimizer to minimize a cost function.