The Qubit's Promise: A Narrative Review of Quantum Information, from Feynman's Simulation to Error Correction
Zen Revista, 10 PHYSICS
Quantum information is physics' claim on computation: the argument, opened by Feynman in 1982, that quantum systems are efficiently simulated only by quantum machines, and the program—qubits, gates, algorithms, and error correction—that turned the argument into an engineering discipline. This article presents a narrative review of the primary literature that built the field, from Feynman's 1982 simulation proposal and Deutsch's 1985 universal quantum computer, through the Deutsch–Jozsa problem, which showed quantum algorithms' separation, Shor's 1994 factoring algorithm, whose period-finding broke public-key cryptography's assumptions, Grover's 1996 quadratic search speedup, Shor's 1995 and Steane's 1996 error-correcting codes, which answered decoherence—the field's standing objection—Cirac and Zoller's 1995 trapped-ion gates and Knill, Laflamme, and Milburn's 2001 linear-optical scheme, Bennett and Brassard's 1984 quantum cryptography, and Nielsen and Chuang's 2000 codifying textbook. The synthesis is organized around three themes: the computational settlement, in which quantum parallelism was formalized and weaponized into algorithms with provable speedups; the error-correction settlement, in which the no-cloning obstacle was circumvented and fragile states made correctable; and the physical settlement, in which implementations—ions, photons, and their successors—gave the theory its hardware. It is concluded that quantum information's history is the conversion of an objection—quantum states are too fragile to compute with—into the field's defining technology: error correction, the discipline that made the qubit a promise kept in principle.
•Aug 29, 2026•0 citations