Quantum Computing Acronyms

The complexity class of problems a quantum computer can solve efficiently with high probability of correctness — the quantum analog of P.

Today's era of quantum hardware — tens to a few thousand qubits, too noisy and small for the most dramatic promised applications.

Techniques for protecting quantum information from decoherence and gate errors by encoding logical qubits across many physical qubits.

Using quantum mechanics to establish encryption keys whose security is guaranteed by physics, not just mathematical assumptions.

Classical cryptography mathematically designed to resist attacks from quantum computers — does not itself use quantum hardware.

A hybrid quantum-classical algorithm for finding ground-state energies of molecules — one of the most promising near-term quantum applications.

A hybrid algorithm for finding approximate solutions to combinatorial optimization problems like routing and scheduling.

The quantum analog of the discrete Fourier transform — a key subroutine inside Shor's Algorithm and quantum phase estimation.

A quantum computer's processor — the physical chip or device containing the qubits, analogous to a CPU or GPU.

An algorithm for extracting eigenvalue information from a quantum operation — used inside Shor's Algorithm and chemistry simulation.

A quantum algorithm for solving linear systems of equations exponentially faster than classical methods, under specific conditions.

A hypothetical memory architecture that would let quantum algorithms efficiently load classical data — a major bottleneck in practice.

The intersection of quantum computing and machine learning — exploring whether quantum circuits can accelerate specific ML tasks.

A trapped-ion architecture where ions are physically shuttled between trap zones to achieve flexible qubit connectivity.

An error-resistant way of encoding a logical qubit using continuous-variable photonic states.

A benchmark metric (introduced by IBM) combining qubit count, connectivity, and gate error rates into a single comparative number.

Two measures of qubit coherence time — T1 measures energy relaxation, T2 measures phase coherence.

A quantum computing approach (used by Xanadu) encoding information in continuous properties of light rather than discrete qubits.

The standard qubit model — information encoded in discrete |0⟩/|1⟩ states, as opposed to continuous-variable approaches.

An error mitigation technique that runs circuits at deliberately varied noise levels and extrapolates back to a zero-noise estimate.

A classical decoding algorithm commonly used to interpret error syndromes in surface code quantum error correction.

A technique for implementing quantum operations that aren't directly realizable as a single gate, by combining several unitary operations.

An advanced framework for designing quantum algorithms with optimal resource efficiency, used in modern quantum simulation.

The first quantum algorithm demonstrating a provable speedup — determines if a function is constant or balanced.

The general technique (generalizing Grover's Algorithm) for boosting the probability of measuring a desired outcome.

An alternative quantum computing model based on slowly evolving a system's Hamiltonian — the theoretical basis for quantum annealing.

Quantum computing reliable enough to run arbitrarily long computations despite physical errors, using full error correction.

The most secure known form of quantum cryptography — security holds even without trusting the quantum devices used.