Quantum Computing Fundamentals
Expert-defined terms from the Certificate in Quantum Threat Intelligence (United States) course at London School of Planning and Management. Free to read, free to share, paired with a professional course.
A – Amplitude #
A – Amplitude
Explanation #
The complex number whose squared magnitude gives the probability of measuring a particular qubit state.
Example #
For a qubit in state α|0⟩ + β|1⟩, |α|² and |β|² are the measurement probabilities.
Practical application #
Determines interference patterns in quantum algorithms such as Grover’s search.
Challenge #
Maintaining precise amplitude values in the presence of noise and decoherence.
Algorithmic Complexity – Quantum algorithmic complexity #
Algorithmic Complexity – Quantum algorithmic complexity
Explanation #
A measure of the resources (time, space) required for a quantum algorithm to solve a problem, often expressed in terms of quantum gate count.
Example #
Shor’s factoring algorithm runs in polynomial time, contrasting with exponential classical complexity.
Practical application #
Guides selection of quantum algorithms for cryptanalysis tasks.
Challenge #
Accurately estimating complexity when hardware constraints limit gate fidelity.
Amplitude Damping – Quantum noise channel #
Amplitude Damping – Quantum noise channel
Explanation #
A noise process that models energy loss from a qubit, causing excited states to decay toward the ground state.
Example #
An excited qubit |1⟩ decays to |0⟩ with probability γ.
Practical application #
Used in error‑model simulations for superconducting qubits.
Challenge #
Mitigating amplitude damping through error‑correcting codes and dynamical decoupling.
Annealing – Quantum annealing #
Annealing – Quantum annealing
Explanation #
A process that slowly transforms a simple Hamiltonian into a problem Hamiltonian, allowing the system to settle into a low‑energy solution.
Example #
Mapping a Max‑Cut problem onto a quantum annealer to find near‑optimal partitions.
Practical application #
Heuristic optimization for logistics and portfolio selection.
Challenge #
Controlling thermal excitations that cause the system to deviate from the ground state.
Bell State – Maximally entangled two‑qubit state #
Bell State – Maximally entangled two‑qubit state
Explanation #
One of four orthogonal states (|Φ⁺⟩, |Φ⁻⟩, |Ψ⁺⟩, |Ψ⁻⟩) that exhibit perfect correlation between qubits.
Example #
|Φ⁺⟩ = ( |00⟩ + |11⟩ ) / √2.
Practical application #
Basis for quantum key distribution protocols such as BBM92.
Challenge #
Preserving Bell‑state fidelity across noisy channels and long distances.
Bloch Sphere – Geometric representation of a qubit #
Bloch Sphere – Geometric representation of a qubit
Explanation #
A unit sphere where any pure qubit state maps to a point defined by polar and azimuthal angles.
Example #
The state |+⟩ lies on the equator at φ = 0.
Practical application #
Visualizing single‑qubit gate operations and error rotations.
Challenge #
Extending intuitive visualization to multi‑qubit entangled states.
Born Rule – Probability postulate #
Born Rule – Probability postulate
Explanation #
States that the probability of obtaining a measurement outcome equals the squared magnitude of the corresponding amplitude.
Example #
If a qubit has amplitude α for |0⟩, the probability of measuring 0 is |α|².
Practical application #
Underpins statistical analysis of quantum experiment results.
Challenge #
Interpreting probabilities when decoherence blurs pure‑state amplitudes.
Boson Sampling – Special‑purpose quantum computation #
Boson Sampling – Special‑purpose quantum computation
Explanation #
A problem where identical bosons (photons) pass through a linear interferometer; sampling the output distribution is believed to be classically intractable.
Example #
Using a 50‑photon interferometer to demonstrate quantum advantage.
Practical application #
Benchmarking photonic quantum processors.
Challenge #
Scaling photon number while maintaining indistinguishability and low loss.
Braket Notation – Dirac notation #
Braket Notation – Dirac notation
Explanation #
A symbolic language where |ψ⟩ denotes a column vector (ket) and ⟨φ| denotes its conjugate transpose (bra).
Example #
⟨φ|ψ⟩ represents the inner product of two states.
Practical application #
Compactly expressing quantum operations and measurements.
Challenge #
Translating notation into explicit matrix forms for simulation tools.
Clifford Group – Set of stabilizer operations #
Clifford Group – Set of stabilizer operations
Explanation #
The group of unitary operators that map Pauli operators onto Pauli operators under conjugation.
Example #
The Hadamard (H) and Phase (S) gates belong to the Clifford group.
Practical application #
Efficient classical simulation of Clifford circuits; building error‑correcting codes.
Challenge #
Clifford gates alone are insufficient for universal quantum computation; need non‑Clifford resources (e.g., T‑gate).
Coherence Time – Decoherence metric #
Coherence Time – Decoherence metric
Explanation #
The time interval over which a qubit retains its quantum information before environmental interactions cause loss of phase or energy.
Example #
Superconducting transmons often exhibit T₁ ≈ 100 µs and T₂ ≈ 80 µs.
Practical application #
Determines feasible circuit depth for error‑free execution.
Challenge #
Engineering materials and control pulses to extend coherence while scaling qubit count.
Controlled‑NOT (CNOT) Gate – Two‑qubit entangling gate #
Controlled‑NOT (CNOT) Gate – Two‑qubit entangling gate
Explanation #
A gate that flips the target qubit if and only if the control qubit is in state |1⟩.
Example #
Acting on |10⟩ yields |11⟩; acting on |00⟩ leaves the state unchanged.
Practical application #
Core component for constructing Bell states and quantum error‑correcting codes.
Challenge #
Achieving high‑fidelity CNOT operations across different qubit technologies.
Cross‑Entropy Benchmarking – Performance metric #
Cross‑Entropy Benchmarking – Performance metric
Explanation #
A statistical test comparing the output distribution of a quantum processor against the ideal distribution, yielding a cross‑entropy difference value.
Example #
Google's Sycamore chip achieved a cross‑entropy score indicating ~0.2 % error per gate.
Practical application #
Validates quantum advantage claims and monitors hardware drift.
Challenge #
Scaling benchmarking methods for larger qubit registers without exponential classical simulation.
Decoherence – Loss of quantum information #
Decoherence – Loss of quantum information
Explanation #
The process by which a quantum system loses its coherent superposition due to interaction with external degrees of freedom.
Example #
Phase noise from fluctuating magnetic fields causing qubit dephasing.
Practical application #
Central factor in designing error‑mitigation strategies.
Challenge #
Quantifying and suppressing decoherence in noisy intermediate‑scale quantum (NISQ) devices.
Density Matrix – Mixed‑state representation #
Density Matrix – Mixed‑state representation
Explanation #
A matrix ρ = ∑ₖ pₖ|ψₖ⟩⟨ψₖ| that encodes statistical mixtures of pure states, allowing description of systems with classical uncertainty or entanglement with an environment.
Example #
The maximally mixed single‑qubit state is ρ = ½I.
Practical application #
Used to model open‑system dynamics and compute expectation values.
Challenge #
Managing exponential growth of matrix size for many‑qubit systems.
Discrete Variable Quantum Computing (DVQC) – Qubit‑based model #
Discrete Variable Quantum Computing (DVQC) – Qubit‑based model
Explanation #
A paradigm where information is encoded in two‑level systems (qubits) and processed via a sequence of unitary gates.
Example #
Implementing Shor’s algorithm on a superconducting qubit platform.
Practical application #
Dominant framework for most current quantum hardware.
Challenge #
Scaling gate depth while maintaining error rates below fault‑tolerance thresholds.
Don’t‑Care Qubit – Ancilla with relaxed fidelity #
Don’t‑Care Qubit – Ancilla with relaxed fidelity
Explanation #
An auxiliary qubit used in error‑correction circuits whose final state is discarded, allowing slightly lower fidelity requirements.
Example #
Ancilla used in surface‑code stabilizer measurement.
Practical application #
Reduces overall hardware overhead in fault‑tolerant designs.
Challenge #
Ensuring that errors from don’t‑care qubits do not propagate to logical data.
Double‑Slash Notation – Quantum circuit shorthand #
Double‑Slash Notation – Quantum circuit shorthand
Explanation #
A textual representation where “//” indicates parallel execution of gates on different qubits.
Example #
H0 // H1 denotes simultaneous Hadamard gates on qubits 0 and 1.
Practical application #
Facilitates concise description of large circuits in source code.
Challenge #
Maintaining readability when many parallel layers are present.
Entanglement Entropy – Quantifier of quantum correlation #
Entanglement Entropy – Quantifier of quantum correlation
Explanation #
The entropy of a subsystem obtained by tracing out the rest; measures the amount of entanglement between parts of a composite system.
Example #
For a maximally entangled Bell pair, each qubit has entropy = 1 bit.
Practical application #
Evaluates resource requirements for quantum simulations of many‑body systems.
Challenge #
Computing entropy for large, highly entangled states remains computationally intensive.
Fidelity – Overlap measure #
Fidelity – Overlap measure
Explanation #
The probability that two quantum states are indistinguishable; for pure states |ψ⟩ and |φ⟩, fidelity = |⟨ψ|φ⟩|².
Example #
A gate with 99.9 % fidelity yields an error rate of 0.1 %.
Practical application #
Benchmarking quantum hardware and error‑correction performance.
Challenge #
Accurately measuring fidelity for multi‑qubit processes without exhaustive tomography.
Fourier Transform – Quantum Fourier Transform (QFT) #
Fourier Transform – Quantum Fourier Transform (QFT)
Explanation #
A linear transformation that maps computational basis states to superpositions with specific phase relationships; implemented efficiently with O(n²) gates for n qubits.
Example #
QFT applied to |5⟩ on three qubits produces a superposition with amplitudes proportional to complex roots of unity.
Practical application #
Central to order‑finding subroutine in factoring algorithms.
Challenge #
Gate errors accumulate rapidly; requires error‑corrected implementation for deep QFT circuits.
Gate Set Tomography (GST) – Comprehensive characterization #
Gate Set Tomography (GST) – Comprehensive characterization
Explanation #
A protocol that simultaneously estimates state preparation, measurement, and gate errors, yielding a complete error model for a quantum processor.
Example #
GST can reveal correlated errors between adjacent CNOT gates.
Practical application #
Informs targeted calibration and error‑mitigation strategies.
Challenge #
Computational overhead grows exponentially with the number of qubits characterized.
Geometric Phase – Berry phase #
Geometric Phase – Berry phase
Explanation #
A phase acquired by a quantum system when its parameters undergo a cyclic, adiabatic change, dependent only on the path’s geometry.
Example #
Implementing a phase gate via a closed loop on the Bloch sphere.
Practical application #
Provides robustness against certain types of noise in holonomic gates.
Challenge #
Precise control of the evolution path to avoid unintended dynamical phases.
Grover’s Algorithm – Quantum search #
Grover’s Algorithm – Quantum search
Explanation #
An algorithm that finds a marked item in an unstructured database of size N using O(√N) queries, by iteratively amplifying the amplitude of the target state.
Example #
Searching a 2⁴‑item list requires only ~4 iterations instead of 16 classical checks.
Practical application #
Speeding up brute‑force cryptanalysis such as key‑search attacks.
Challenge #
Oracle construction for real‑world problems can be costly; algorithm effectiveness diminishes with noise.
Hadamard Gate – H gate #
Hadamard Gate – H gate
Explanation #
A single‑qubit gate that maps |0⟩ → (|0⟩ + |1⟩)/√2 and |1⟩ → (|0⟩ − |1⟩)/√2, creating equal superposition of computational basis states.
Example #
Applying H to |0⟩ yields the state |+⟩.
Practical application #
Initial step in many algorithms to generate uniform superpositions.
Challenge #
Imperfect H gates introduce phase errors that degrade algorithmic performance.
Hamiltonian – Energy operator #
Hamiltonian – Energy operator
Explanation #
An operator H that governs the time evolution of a quantum system via the equation iħ∂|ψ⟩/∂t = H|ψ⟩.
Example #
The Ising Hamiltonian encodes spin‑spin couplings for optimization problems.
Practical application #
Designing problem Hamiltonians for adiabatic quantum computing.
Challenge #
Engineering precise Hamiltonian terms on hardware while suppressing unwanted interactions.
Hybrid Quantum #
Classical Algorithm – Variational approach
Explanation #
An algorithm that delegates part of the computation to a classical optimizer, which updates parameters of a quantum circuit iteratively.
Example #
Variational Quantum Eigensolver (VQE) finds molecular ground‑state energies by minimizing expectation values.
Practical application #
Near‑term quantum chemistry simulations on NISQ devices.
Challenge #
Classical optimizer may become trapped in local minima; quantum noise can bias gradient estimates.
IBM Quantum Experience – Cloud‑based platform #
IBM Quantum Experience – Cloud‑based platform
Explanation #
A publicly accessible service offering remote execution of quantum circuits on IBM’s superconducting processors and simulators.
Example #
Users can run a Bell‑state circuit on a 5‑qubit device via a web interface.
Practical application #
Educational labs, prototyping of quantum threat‑intel tools.
Challenge #
Queue times and limited qubit connectivity can affect experiment reproducibility.
Identity Gate – I gate #
Identity Gate – I gate
Explanation #
A gate that leaves the qubit state unchanged; represented by the 2×2 identity matrix.
Example #
Inserting an I gate can align timing of parallel circuit branches.
Practical application #
Used to pad circuits for synchronization or to model idle periods.
Challenge #
Physical idle time may still expose qubits to decoherence despite the logical identity operation.
Imaginary Time Evolution – Non‑unitary simulation #
Imaginary Time Evolution – Non‑unitary simulation
Explanation #
Evolution under e^(−Hτ) (τ > 0) projects a state onto the ground state of Hamiltonian H, useful for approximating low‑energy properties.
Example #
Variational algorithms simulate imaginary time to find molecular ground states.
Practical application #
Quantum chemistry and material‑science simulations.
Challenge #
Implementing non‑unitary processes on unitary quantum hardware requires ancillary techniques.
Indistinguishability – Photon identity #
Indistinguishability – Photon identity
Explanation #
The property that photons cannot be labeled individually, leading to interference effects when their wavefunctions overlap perfectly.
Example #
Two photons entering a beam splitter exit together due to indistinguishability.
Practical application #
Essential for photonic quantum computing and boson‑sampling experiments.
Challenge #
Maintaining indistinguishability across separate sources and over long fiber links.
Inverse Quantum Fourier Transform (IQFT) – Adjoint of QFT #
Inverse Quantum Fourier Transform (IQFT) – Adjoint of QFT
Explanation #
The unitary operation that undoes the transformation performed by the QFT, restoring computational basis states from the Fourier domain.
Example #
IQFT applied after a phase‑estimation circuit extracts the eigenvalue bits.
Practical application #
Completes the order‑finding subroutine in Shor’s algorithm.
Challenge #
Same error accumulation concerns as QFT; requires high‑fidelity controlled‑phase gates.
Ising Model – Spin‑glass Hamiltonian #
Ising Model – Spin‑glass Hamiltonian
Explanation #
A mathematical model describing interacting binary variables (spins) with pairwise couplings and external fields, often used to encode combinatorial problems.
Example #
Mapping a MAX‑SAT instance onto an Ising Hamiltonian for quantum annealing.
Practical application #
Formulating optimization tasks for adiabatic quantum computers.
Challenge #
Translating arbitrary problem constraints into physically realizable coupling strengths.
Knill‑Laflamme‑Milburn (KLM) Scheme – Linear‑optics quantum computing<… #
Knill‑Laflamme‑Milburn (KLM) Scheme – Linear‑optics quantum computing
Explanation #
A protocol demonstrating that scalable quantum computation is possible using only linear optical elements, single‑photon sources, and projective measurements.
Example #
Implementing a probabilistic CNOT gate with beam splitters and detectors.
Practical application #
Basis for many photonic quantum processor designs.
Challenge #
Low success probabilities necessitate extensive resource overhead and multiplexing.
Logical Qubit – Encoded error‑protected qubit #
Logical Qubit – Encoded error‑protected qubit
Explanation #
A qubit realized by encoding several physical qubits into a subspace that can detect and correct errors without measuring the logical information.
Example #
The [[7,1,3]] Steane code protects one logical qubit using seven physical qubits.
Practical application #
Enables reliable computation beyond the physical error rates of hardware.
Challenge #
Overhead in qubit count and gate depth can be prohibitive for near‑term devices.
Measurement‑Based Quantum Computing (MBQC) – One‑way model #
Measurement‑Based Quantum Computing (MBQC) – One‑way model
Explanation #
A model where a highly entangled resource state (cluster) is prepared first, and computation proceeds via a sequence of single‑qubit measurements, with later measurement bases depending on earlier outcomes.
Example #
Performing a universal set of gates by measuring qubits in specific bases on a 2‑D cluster.
Practical application #
Offers alternative architecture for photonic and trapped‑ion platforms.
Challenge #
Generating large, high‑fidelity cluster states remains experimentally demanding.
Noise Channel – Quantum operation model #
Noise Channel – Quantum operation model
Explanation #
A completely positive, trace‑preserving map that describes how a quantum state evolves under the influence of noise.
Example #
The depolarizing channel replaces the state with the maximally mixed state with probability p.
Practical application #
Used in error‑mitigation simulations and hardware benchmarking.
Challenge #
Accurately characterizing multi‑qubit correlated noise channels.
Non‑Clifford Gate – T gate (π/8 gate) #
Non‑Clifford Gate – T gate (π/8 gate)
Explanation #
A gate that does not belong to the Clifford group; its inclusion with Clifford gates yields a universal gate set. The T gate applies a phase of e^{iπ/4} to the |1⟩ component.
Example #
T|+⟩ = (e^{iπ/8}|0⟩ + e^{−iπ/8}|1⟩)/√2.
Practical application #
Required for implementing arbitrary rotations and quantum error‑correcting codes via magic‑state distillation.
Challenge #
T‑gate synthesis is costly in fault‑tolerant regimes, demanding many ancillary resources.
Observable – Hermitian operator #
Observable – Hermitian operator
Explanation #
Any Hermitian operator A whose eigenvalues correspond to possible outcomes of a measurement; the system’s state yields a probability distribution over these outcomes.
Example #
The Pauli‑Z operator measures the computational‑basis state of a qubit.
Practical application #
Defining cost functions for variational algorithms.
Challenge #
Designing observables that can be efficiently measured on hardware with limited connectivity.
Pauli Operators – X, Y, Z #
Pauli Operators – X, Y, Z
Explanation #
Single‑qubit Hermitian matrices that form a basis for all 2 × 2 operators; they anticommute pairwise and square to identity.
Example #
X = |0⟩⟨1| + |1⟩⟨0| flips the qubit state.
Practical application #
Basis for constructing error‑detecting codes and for Hamiltonian decomposition.
Challenge #
Mapping multi‑qubit Pauli strings onto hardware with limited native interactions.
Phase Estimation Algorithm (PEA) – Eigenvalue extraction #
Phase Estimation Algorithm (PEA) – Eigenvalue extraction
Explanation #
An algorithm that estimates the phase φ associated with an eigenstate |ψ⟩ of a unitary U, where U|ψ⟩ = e^{2πiφ}|ψ⟩, using controlled‑U operations and QFT.
Example #
Determining the energy eigenvalues of a molecular Hamiltonian by encoding them as phases.
Practical application #
Core subroutine for Shor’s algorithm and quantum chemistry simulations.
Challenge #
Requires high‑precision controlled operations and coherent ancilla registers.
Physical Qubit – Hardware implementation #
Physical Qubit – Hardware implementation
Explanation #
The actual quantum two‑level system realized in a laboratory, subject to specific error mechanisms and control constraints.
Example #
A transmon qubit fabricated on a silicon chip with Josephson junctions.
Practical application #
The building block for all quantum processors.
Challenge #
Balancing coherence, controllability, and scalability across different technologies.
Poisson Distribution – Statistical model for photon counts #
Poisson Distribution – Statistical model for photon counts
Explanation #
Describes the probability of observing k events (e.g., photon detections) when events occur independently with a known average rate λ.
Example #
A weak coherent laser source yields photon numbers following a Poisson distribution with mean photon number μ.
Practical application #
Modeling noise in photonic quantum communication channels.
Challenge #
Distinguishing Poissonian noise from other decoherence sources in experimental data.
Quantum Advantage – Computational superiority #
Quantum Advantage – Computational superiority
Explanation #
The point at which a quantum device solves a task faster or more efficiently than any known classical algorithm for that task.
Example #
Demonstrating sampling from a random circuit distribution that is intractable for classical supercomputers.
Practical application #
Validates the practical utility of quantum processors for specific domains.
Challenge #
Defining clear, verifiable benchmarks that avoid loopholes and ensure reproducibility.
Quantum Annealer – Specialized optimizer #
Quantum Annealer – Specialized optimizer
Explanation #
A hardware system designed to implement quantum annealing, where qubits evolve under a time‑dependent Hamiltonian toward a low‑energy configuration of a problem Hamiltonian.
Example #
Solving a graph‑partitioning problem using a 2000‑qubit D‑Wave system.
Practical application #
Approximate solutions for combinatorial optimization in logistics and finance.
Challenge #
Quantifying the genuine quantum contribution versus classical thermal effects.
Quantum Channel – Communication medium #
Quantum Channel – Communication medium
Explanation #
A completely positive, trace‑preserving map that describes how quantum states are transmitted from sender to receiver, possibly undergoing noise.
Example #
A fiber‑optic link subject to photon loss modeled by an amplitude‑damping channel.
Practical application #
Secure quantum key distribution over long distances.
Challenge #
Extending channel length while preserving entanglement and low error rates.
Quantum Circuit – Gate model representation #
Quantum Circuit – Gate model representation
Explanation #
A diagrammatic or textual description of a computation as a series of quantum gates acting on qubits over discrete time steps.
Example #
A circuit comprising H, CNOT, and T gates that implements a Toffoli operation.
Practical application #
Basis for compiling algorithms into hardware‑specific instruction sets.
Challenge #
Mapping abstract circuits onto devices with limited connectivity and gate sets.
Quantum Error Correction (QEC) – Fault‑tolerant technique #
Quantum Error Correction (QEC) – Fault‑tolerant technique
Explanation #
A set of methods that detect and correct errors on physical qubits without collapsing the encoded logical information, typically using redundant encoding and stabilizer measurements.
Example #
The surface code corrects both bit‑flip and phase‑flip errors by measuring plaquette stabilizers.
Practical application #
Enables scalable, reliable quantum computation beyond NISQ limits.
Challenge #
Achieving error rates below the fault‑tolerance threshold (~10⁻³ – 10⁻⁴) for all native operations.
Quantum Fourier Sampling – Algorithmic primitive #
Quantum Fourier Sampling – Algorithmic primitive
Explanation #
A technique that samples from the Fourier transform of a function to reveal hidden periodicities, forming the basis of many quantum algorithms.
Example #
Using Fourier sampling to solve the discrete logarithm problem in certain groups.
Practical application #
Threat analysis of cryptographic schemes vulnerable to hidden‑subgroup attacks.
Challenge #
Implementing efficient quantum Fourier transforms on noisy hardware.
Quantum Gate Fidelity – Performance metric #
Quantum Gate Fidelity – Performance metric
Explanation #
The average closeness between the implemented gate and the ideal unitary operation, often expressed as a percentage.
Example #
A single‑qubit gate with 99.5 % fidelity has an error rate of 0.5 %.
Practical application #
Guides calibration routines and error‑mitigation strategies.
Challenge #
Isolating gate errors from state preparation and measurement (SPAM) errors in experimental data.
Quantum Key Distribution (QKD) – Secure communication #
Quantum Key Distribution (QKD) – Secure communication
Explanation #
A protocol that uses quantum states to generate shared secret keys between parties, guaranteeing security based on the laws of quantum mechanics.
Example #
The BB84 protocol encodes bits in non‑orthogonal photon polarizations.
Practical application #
Protecting classified communications against future quantum attacks.
Challenge #
Implementing QKD over metropolitan networks while managing loss and detector imperfections.
Quantum Machine Learning (QML) – Hybrid algorithms #
Quantum Machine Learning (QML) – Hybrid algorithms
Explanation #
The study of algorithms that leverage quantum resources to improve machine‑learning tasks, either by speeding up subroutines or by processing quantum data directly.
Example #
A variational quantum classifier trained to distinguish malware signatures encoded as quantum states.
Practical application #
Enhancing threat‑intelligence analytics with quantum‑accelerated pattern recognition.
Challenge #
Demonstrating clear advantage over classical machine‑learning models on realistic datasets.
Quantum Noise – Environmental disturbance #
Quantum Noise – Environmental disturbance
Explanation #
Unwanted interactions between a quantum system and its surroundings that cause loss of coherence and introduce errors.
Example #
Fluctuating magnetic fields causing phase drift in spin‑based qubits.
Practical application #
Modeling noise is essential for designing error‑mitigation protocols.
Challenge #
Characterizing correlated noise across large qubit arrays.
Quantum Phase Estimation (QPE) – Eigenvalue determination #
Quantum Phase Estimation (QPE) – Eigenvalue determination
Explanation #
A procedure that estimates the phase φ of an eigenstate of a unitary operator by applying controlled powers of the unitary and performing an inverse QFT on the ancilla register.
Example #
Determining molecular orbital energies for quantum chemistry simulations.
Practical application #
Central to algorithms for solving linear systems and factoring.
Challenge #
Requires deep circuits with many controlled‑U operations, vulnerable to noise.
Quantum Processor – Integrated quantum device #
Quantum Processor – Integrated quantum device
Explanation #
A physical system containing multiple qubits, interconnects, and control lines that can execute quantum circuits.
Example #
A 127‑qubit superconducting processor housed in a dilution refrigerator.
Practical application #
Platform for running threat‑intelligence algorithms that analyze encrypted traffic.
Challenge #
Scaling interconnects and control infrastructure without degrading coherence.
Quantum Programming Language – Software abstraction #
Quantum Programming Language – Software abstraction
Explanation #
A high‑level language designed to express quantum algorithms, compile them into hardware‑specific instructions, and manage classical‑quantum interaction.
Example #
Writing a Grover search using Qiskit’s QuantumCircuit class.
Practical application #
Enables rapid prototyping of quantum threat‑intel tools.
Challenge #
Maintaining portability across diverse hardware back‑ends while exposing low‑level optimization knobs.
Quantum Random Access Memory (QRAM) – Data loading structure #
Quantum Random Access Memory (QRAM) – Data loading structure
Explanation #
A theoretical memory device that allows retrieval of data in superposition, enabling algorithms that require quantum‑parallel data access.
Example #
Loading a vector of N classical numbers into a quantum register for amplitude‑encoding.
Practical application #
Speeding up linear‑algebra subroutines in quantum machine learning.
Challenge #
Physical realization of scalable, low‑error QRAM remains an open research problem.
Quantum Register – Multi‑qubit storage #
Quantum Register – Multi‑qubit storage
Explanation #
A collection of qubits that can be collectively addressed and manipulated as a single logical entity.
Example #
A 4‑qubit register initialized to |0000⟩ for use in a small‑scale algorithm.
Practical application #
Holds intermediate results and ancillae during circuit execution.
Challenge #
Managing cross‑talk and correlated errors across the register.
Quantum Resource Estimation – Cost analysis #
Quantum Resource Estimation – Cost analysis
Explanation #
The process of quantifying the number of qubits, gates, and error rates required to execute a given algorithm to a desired accuracy.
Example #
Estimating that factoring a 2048‑bit RSA modulus needs ~20 million physical qubits with error < 10⁻³.
Practical application #
Guides strategic planning for hardware development and timeline forecasting.
Challenge #
Accurately modeling overhead from error correction and fault‑tolerant compilation.
Quantum State Tomography – Reconstruction technique #
Quantum State Tomography – Reconstruction technique
Explanation #
A method for determining the full density matrix of a quantum state by performing a series of measurements in different bases and applying statistical reconstruction.
Example #
Reconstructing a two‑qubit Bell state by measuring in the X, Y, and Z bases.
Practical application #
Validates state preparation fidelity for cryptographic protocols.
Challenge #
Number of required measurements grows exponentially with qubit count, making full tomography impractical beyond ~6 qubits.
Quantum Supremacy – Demonstrated advantage #
Quantum Supremacy – Demonstrated advantage
Explanation #
The experimental milestone where a quantum processor performs a computation that is infeasible for any classical computer within a reasonable time frame.
Example #
Google’s 53‑qubit Sycamore device sampling from a random circuit in 200 seconds, a task estimated to take thousands of years on a classical supercomputer.
Practical application #
Provides proof‑of‑concept that quantum hardware can outperform classical systems.
Challenge #
Ensuring that the task is not only hard for classical simulation but also has practical relevance.
Quantum Teleportation – State transfer protocol #
Quantum Teleportation – State transfer protocol
Explanation #
A procedure that transmits an unknown quantum state from one location to another using a shared entangled pair and two bits of classical information.
Example #
Sending the state of qubit A to qubit B via a Bell‑state measurement and Pauli corrections.
Practical application #
Enables distributed quantum computing and secure communication.
Challenge #
Loss and decoherence degrade teleportation fidelity; requires high‑quality entanglement distribution.
Quantum Volume – Holistic performance metric #
Quantum Volume – Holistic performance metric
Explanation #
A composite figure of merit that captures the largest random circuit of equal width and depth a quantum processor can successfully execute with acceptable fidelity.
Example #
A system with a quantum volume of 64 can run 6‑qubit, depth‑6 random circuits reliably.
Practical application #
Provides a vendor‑agnostic way to compare different quantum hardware platforms.
Challenge #
Metric may not reflect performance on specific, structured algorithms of interest.
Qubit – Quantum bit #
Qubit – Quantum bit
Explanation #
The fundamental unit of quantum information, represented by a two‑dimensional Hilbert space with basis states |0⟩ and |1⟩.
Example #
A superconducting transmon, an electron spin, or a photon polarization can serve as a qubit.
Practical application #
Building blocks for all quantum algorithms and protocols.
Challenge #
Balancing coherence, controllability, and scalability across physical implementations.
Qubit Connectivity – Interaction graph #
Qubit Connectivity – Interaction graph
Explanation #
The pattern of allowed