Quantum Computing Glossary

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

IonQ's benchmark for the number of effectively usable qubits a system provides for running an algorithm, accounting for connectivity, gate fidelity, and circuit depth rather than counting physical qubits.

A quantum algorithm that estimates the probability amplitude of a marked outcome quadratically faster than classical Monte Carlo sampling, the basis of proposed quantum speedups in derivative pricing and risk analysis.

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 lattice-based key encapsulation algorithm NIST standardized as ML-KEM, the post-quantum replacement for Diffie-Hellman and RSA key exchange.

The lattice-based digital signature algorithm NIST standardized as ML-DSA, the primary post-quantum replacement for RSA and ECDSA signatures.

Circuit Layer Operations Per Second: IBM's speed benchmark measuring how fast a quantum system executes complete circuits, paired with Quantum Volume for quality.

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

Linking multiple QPUs over quantum interconnects so they behave as one larger logical machine.

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

An early quantum algorithm that determines whether a hidden function is constant or balanced in a single query, versus up to half the possible inputs classically, historically important as the first proof that quantum computers can offer an exponential speedup.

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 lattice-based digital signature algorithm NIST standardized as FN-DSA, chosen for its compact signature size where bandwidth or storage is constrained.

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.

A quantum algorithm, named for Harrow, Hassidim, and Lloyd, that solves systems of linear equations exponentially faster than classical methods under a specific and restrictive set of conditions.

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.

A qubit encoded in the internal states of an individual neutral atom held in place by a focused laser beam (an optical tweezer), with Rydberg states used to entangle neighboring atoms.

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.

A qubit encoded in a property of a single photon, such as polarization or path, that can travel through optical fiber and operate without deep cryogenic cooling.

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.

A system that links separate quantum processors by distributing entanglement between them, usually carried by photons.

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.

An algorithm that estimates the eigenvalue phase of a unitary operator: the subroutine underlying Shor's algorithm and quantum chemistry energy calculations.

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 run on real QPUs.

The hypothetical point at which a quantum computer breaks currently deployed public-key cryptography.

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.

A protocol that transmits an unknown qubit's exact state to a distant qubit using pre-shared entanglement and two classical bits, without physically moving the particle or violating the no-cloning theorem.

A specialized approach to quantum computing that finds low-energy solutions to optimization problems by slowly evolving a system of qubits from an easy starting state toward one whose lowest-energy configuration encodes the answer.

The demonstration that a quantum computer can solve some specific, often contrived, task faster than any classical computer or algorithm can, regardless of whether the task itself is useful.

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 classical computation that turns error-syndrome measurements into an actual correction.

A qubit built from a superconducting circuit containing one or more Josephson junctions, cooled to near absolute zero and controlled with microwave pulses.

A qubit encoded in the spin state of a single electron or nucleus confined in a semiconductor quantum dot, built using processes adapted from conventional chip manufacturing.

A stateless, hash-based digital signature algorithm NIST standardized as SLH-DSA, offering a conservative fallback if lattice-based schemes are ever broken.

A protocol that sends two classical bits of information by physically transmitting only one qubit, using a pre-shared entangled pair to double the channel's classical capacity.

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

A qubit encoded in the internal energy levels of an individual ion held in place by electromagnetic fields and controlled with laser pulses.

A theorized qubit that encodes information in the braiding of exotic quasiparticles so that errors are suppressed by the qubit's underlying topology rather than corrected after the fact.

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.