Visitar URL original
Stabilizer Code -- from Wolfram MathWorld
TOPICS
Search

Stabilizer Code


A stabilizer code on n qubits is a quantum error-correcting code that is the common +1 eigenspace of an abelian group S contained in the n-qubit Pauli group, with -I not in S. The group S is the quantum stabilizer group of the quantum error-correcting code.

If S has n-k independent generators, the code encodes k logical qubits and has dimension 2^k. Error detection and correction can be studied through commutation with the stabilizer generators and the Knill-Laflamme conditions.

Existence bounds for stabilizer codes can be obtained from symplectic self-orthogonal linear codes. Yuan and Zhu (2026) proved a finite-length factor-n improvement of a quantum Gilbert-Varshamov bound in a restricted relative-distance range. The classical self-orthogonal dimension is subtracted from the block length to obtain the number of encoded logical systems.


See also

Abelian Group, Knill-Laflamme Conditions, Pauli Group, Quantum Error-Correcting Code, Qubit

Explore with Wolfram|Alpha

References

Gottesman, D. "Stabilizer Codes and Quantum Error Correction." PhD thesis. Pasadena, CA: California Institute of Technology, 28 May 1997. https://arxiv.org/abs/quant-ph/9705052.Nielsen, M. and Chuang, I. Quantum Computation and Quantum Information. Cambridge, England: Cambridge University Press, 2000.Yuan, C. and Zhu, R. "A Theta(n)-Multiplicative Improvement of the Gilbert-Varshamov Bound for Linear and Quantum Codes." 12 Nov 2026. https://arxiv.org/abs/2611.16447v1.

Cite this as:

Weisstein, Eric W. "Stabilizer Code." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/StabilizerCode.html

Subject classifications