General · EdgepediaOctober 10, 20265 min read

Daniel Gottesman

Daniel Gottesman is the Brin Family Endowed Professor in Theoretical Computer Science at the University of Maryland, a QuICS Fellow, and Co-director of the Joint Center for Quantum Information and Computer Science (QuICS)¹. He is best known for developing the stabilizer code formalism, a group-theoretical framework for creating and describing a large class of quantum error-correcting codes, and for work on performing quantum gates using quantum teleportation¹. His research spans quantum error correction, fault-tolerant quantum computation, quantum cryptography, and quantum complexity².

Key fact	Detail
Current position	Brin Family Endowed Professor in Theoretical Computer Science, University of Maryland; Co-director of QuICS¹
Signature contribution	The stabilizer code formalism, introduced in his 1996 Physical Review A paper and 1997 Caltech PhD thesis³^•⁴
Gottesman–Knill theorem	Stabilizer circuits (CNOT, Hadamard, and phase gates only) can be simulated efficiently on a classical computer; simulation is complete for the class ⊕L⁵
Fault tolerance	Showed universal fault-tolerant computation is possible for any stabilizer code (Phys. Rev. A 57, 127, 1998)⁶
Threshold values	Rigorous proofs give a threshold of at least 2×10⁻⁵ (one error per 50,000 operations); optimized simulations suggest the true threshold may be as high as 5%⁷
Constant overhead	Showed the ratio of physical to logical qubits can be constant in large circuits, using quantum LDPC codes with overhead equal to the inverse rate 1/R⁸

Education and career

Gottesman received his PhD at Caltech in 1997, then did postdocs at Los Alamos National Lab and Microsoft Research¹. He next served in the UC Berkeley computer science department as a Long-Term Prize Fellow with the Clay Mathematics Institute⁹. He then spent 19 years as a faculty member at Perimeter Institute in Waterloo, Ontario before moving to Maryland¹.

His honors include selection for MIT Technology Review's TR100: Top Young Innovators for 2003 and election as a Fellow of the American Physical Society¹.

Stabilizer codes and the Heisenberg representation

Gottesman's 1996 paper "Class of quantum error-correcting codes saturating the quantum Hamming bound" (Phys. Rev. A 54, 1862) develops the formalism of stabilizer codes and describes a class of codes that correct one error using 2ʲ qubits; he calls it probably his most important paper³. His 1997 Caltech thesis, Stabilizer Codes and Quantum Error Correction, presents the group-theoretical structure in full, arguing that this subclass of quantum codes "has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes," and surveys known codes, quantum channel capacity, and bounds on quantum codes⁴.

Independent credit is established in the literature. Andrew M. Steane writes in his 2006 tutorial that "the important concept of the stabilizer is due to Gottesman and independently Calderbank et. al.; this yielded many useful insights into the subject, and permitted many new codes to be discovered"¹⁰. Steane's review also records that Gottesman, independently of Ekert and Macchiavello and others, derived the quantum Hamming bound¹⁰.

The Gottesman–Knill theorem

The Gottesman–Knill theorem states that a stabilizer circuit, meaning a quantum circuit consisting solely of controlled-NOT (CNOT), Hadamard, and phase gates, can be simulated efficiently on a classical computer⁵.

Scott Aaronson and Gottesman showed in 2004 that the problem of simulating stabilizer circuits is complete for the classical complexity class ⊕L, which means stabilizer circuits are probably not even universal for classical computation⁵. The same paper improved the speed of simulation from O(n³) to O(n²) for n qubits, and implemented the algorithm in a freely available program called CHP (CNOT-Hadamard-phase), which can handle thousands of qubits easily³^•⁵.

Fault-tolerant quantum computation and thresholds

To use quantum error-correcting codes to improve a quantum computer's performance, operations must be performed fault-tolerantly on encoded states. Gottesman's 1998 paper "A Theory of Fault-Tolerant Quantum Computation" (Phys. Rev. A 57, 127) presents a general theory of fault-tolerant operations based on symmetries of the code stabilizer, allowing a straightforward determination of which operations can be performed fault-tolerantly on a given code; a transversal operation, which acts independently on each qubit in the block, is the prototypical fault-tolerant operation¹¹. The paper demonstrates that fault-tolerant universal computation is possible for any stabilizer code, discussing the five-quantum-bit code among its examples⁶.

A fault-tolerance threshold is a protocol-dependent bound on the error rate. In a distance-3 fault-tolerant protocol, the probability of logical error for a single logical gate or timestep is at most Cp², so fault tolerance helps when the physical error rate p is below the threshold pₜ = 1/C⁷. The best rigorous proofs of the threshold show it is at least 2×10⁻⁵, meaning one error per 50,000 operations, while optimized simulations of fault-tolerant protocols suggest the true threshold may be as high as 5%⁷. The Aliferis–Gottesman–Preskill 2006 paper pushed rigorous proof further, establishing a threshold above 1/1000 error rate per gate for concatenated error-detecting codes³.

The gap between proven and simulated thresholds has a practical cost: to tolerate error rates near 5%, existing protocols require enormous overhead, perhaps increasing the number of gates and qubits by a factor of a million or more for typical computations⁷.

By the numbers

The aggregator's per-paper counts for key works:

1996 Hamming-bound paper (Phys.
1998 fault-tolerance paper (Phys.
2001 Kitaev–Preskill–Gottesman paper "Encoding a qubit in an oscillator" (Phys.

How it compares with Shor, Steane, and Kitaev

The stabilizer formalism organized a field that had begun with specific constructions. Steane's review records the lineage: Peter Shor proved that 9 qubits could be used to protect a single qubit against general errors, while Steane described a general code construction whose simplest example does the same job using 7 qubits¹⁰. Gottesman's contribution was the general framework that produced and classified such codes, plus the independent derivation of the quantum Hamming bound¹⁰.

His collaboration with Alexei Kitaev and John P. Preskill produced the 2001 Physical Review A paper "Encoding a qubit in an oscillator".¹²

References

Topic: Encyclopedia › Physical world and mathematics › Physical and mathematical scientists › Physicists and astronomers › Researchers in atomic, molecular, and optical physics and quantum information › Quantum information and quantum computing

Initially written Oct 10, 2026 · Edited: Oct 11, 2026; Oct 15, 2026

Notice something wrong?