Quantum computing is a model of computation that uses physical systems governed by quantum mechanics to represent and manipulate information. Conventional computers use bits whose logical states are represented as 0 or 1, whereas quantum computers use quantum bits, or qubits, whose physical states can exhibit quantum properties such as superposition and entanglement. Quantum algorithms exploit these properties together with controlled quantum operations and measurement to solve particular computational problems in ways that can differ fundamentally from classical algorithms.
Quantum computing does not mean that every operation becomes simultaneously faster, nor does it mean that a quantum computer simply evaluates every possible answer and then reads them all out. Measurement produces classical information and generally destroys or changes the quantum state being measured, so useful quantum algorithms must arrange amplitudes so that desired outcomes become more probable and unwanted outcomes interfere destructively. Quantum computing is therefore a specialised computational paradigm rather than a general replacement for conventional computing.
The mathematical foundation of quantum computing is quantum state representation in a complex vector space. A single ideal qubit can be represented as a state of the form alpha times the state 0 plus beta times the state 1, where alpha and beta are complex probability amplitudes satisfying the normalisation condition that the squared magnitudes add to one. The amplitudes themselves are not directly observed as ordinary probabilities.
When the qubit is measured in the computational basis, the probability of obtaining 0 is the squared magnitude of alpha and the probability of obtaining 1 is the squared magnitude of beta. Multiple qubits are represented using tensor products of their individual state spaces. This means the mathematical description of an n-qubit state generally contains 2^n complex amplitudes, although a quantum computer does not provide direct classical access to all of them. Quantum algorithms manipulate this state vector through carefully chosen operations before measurement extracts classical results.
Quantum gates are the basic operations used to manipulate qubits in a quantum circuit. Unlike arbitrary classical Boolean operations, ideal quantum gates are represented by unitary transformations, which preserve the total probability of the quantum state. Single-qubit gates include the Pauli X, Y and Z gates, the Hadamard gate and phase rotations. The X gate is analogous in some contexts to a bit flip, while the Hadamard gate creates equal-magnitude superpositions from computational-basis states.
Multi-qubit gates, particularly controlled operations such as the controlled-NOT gate, can create entanglement and correlate qubits in ways unavailable to independent classical bits. A quantum circuit is a sequence of such operations followed by measurements. The gate sequence is designed so that the amplitudes associated with useful computational outcomes are increased through interference while unsuitable outcomes are reduced. Quantum algorithms therefore rely on the controlled evolution of amplitudes rather than on unrestricted access to all possible states as separate classical answers.
Quantum computing has several important algorithmic advantages in theory, but they are problem-specific. Shor's algorithm provides a polynomial-time quantum method for integer factoring and related problems, creating important implications for public-key cryptography based on factoring or discrete-logarithm assumptions if sufficiently large fault-tolerant quantum computers become available. Grover's algorithm provides a quadratic speedup for unstructured search compared with the corresponding classical black-box search.
Quantum simulation is another major motivation: quantum systems can be difficult to simulate efficiently on classical machines because their state spaces grow rapidly with system size, while controllable quantum systems naturally implement quantum dynamics. Other quantum algorithms address linear-algebraic, optimisation, sampling or algebraic problems under particular assumptions. A quantum speedup is not automatic, however. Algorithms must exploit a structure that provides a provable or experimentally meaningful advantage, and practical performance must include state preparation, error correction, measurement, communication, classical preprocessing and other overheads.
Quantum computing is highly sensitive to errors because quantum states can be disturbed by interactions with their environment and by imperfections in control operations. Decoherence refers broadly to the loss of quantum coherence caused by unwanted environmental interactions, while operational errors can arise from inaccurate pulses, imperfect gates, measurement errors, leakage into unwanted physical states and control electronics. Quantum error correction addresses these problems by encoding logical quantum information across multiple physical qubits.
The information is distributed in an entangled code space so that certain errors can be detected through syndrome measurements without directly measuring the logical information itself. Fault-tolerant quantum computing seeks to perform logical operations in a way that keeps errors below thresholds required for scalable computation. This introduces substantial overhead because one logical qubit can require many physical qubits, depending on the hardware error rates, code and target algorithm. Consequently, the number of physical qubits in a device is not by itself a sufficient measure of its computational capability.
Quantum computers can be implemented using several physical technologies. Superconducting qubits use engineered electrical circuits operated at extremely low temperatures and are manipulated using microwave signals. Trapped-ion systems store quantum information in internal states of individual ions held by electromagnetic fields and manipulate them using laser or optical techniques. Neutral-atom approaches control arrays of atoms using optical systems, while photonic approaches encode quantum information in properties of individual or correlated photons.
Semiconductor spin qubits use quantum states associated with electron or nuclear spins in solid-state structures. Topological approaches have been investigated with the goal of obtaining hardware intrinsically less sensitive to certain errors, although practical implementation remains an active research area. Each platform involves different trade-offs concerning coherence, gate fidelity, connectivity, control complexity, operating temperature, fabrication and scalability. The phrase "quantum computer" therefore refers to a computational architecture implemented using quantum physical systems rather than one unique hardware design.
Quantum computing also requires substantial classical infrastructure. Classical processors control experiments, schedule operations, interpret measurements, perform calibration, manage error-correction routines and often execute parts of hybrid algorithms. Quantum-classical hybrid systems are particularly relevant to near-term experimental applications in which a quantum processor performs a parameterised calculation and a classical optimiser updates parameters based on measured results. The quantum processing unit is therefore not necessarily a standalone computer replacing CPUs and GPUs.
It is more accurately viewed as a specialised computational resource integrated into a larger system. Practical devices also require sophisticated cryogenic equipment or vacuum systems, lasers or microwave electronics, signal generation, readout systems and calibration software depending on the physical platform. These engineering requirements are a major part of the challenge of building useful quantum computing systems.
Quantum computing has historical roots in the recognition that classical computation has difficulty efficiently representing general quantum systems, leading to foundational proposals for quantum simulation and quantum computation in the late twentieth century. The field combines quantum physics, computer science, information theory, mathematics, electrical engineering and materials science. Current quantum computing research spans hardware development, quantum algorithms, error correction, compilation, control, benchmarking, networking and applications.
It is important to distinguish demonstrated quantum computational experiments from claims of practical advantage for real-world workloads. A device can demonstrate a quantum effect or execute a quantum circuit without delivering an economically useful advantage over the best classical method. The central scientific objective is to construct sufficiently accurate, scalable and controllable quantum processors on which algorithms can execute reliably enough to provide a meaningful computational benefit for selected problems.
