A stabilizer group is an abelian subgroup of the Pauli group that does not contain . Its simultaneous positive eigenspace is its stabilizer subspace.
A set of stabilizer generators is an independent commuting family of Hermitian Pauli operators whose products form a stabilizer group.
A stabilizer state on qubits is the unique simultaneous positive eigenstate of a stabilizer group with independent generators.
Stabilizer-state preparation starts from a computational-basis state and applies a Clifford circuit, producing a stabilizer state.
A stabilizer tableau represents each Pauli generator by a binary row , with one additional bit when its sign is retained. Clifford gates update these rows by arithmetic over .
For an undirected graph , the graph state is
The graph-state stabilizer generator at vertex is . Two such generators commute because adjacent vertices contribute two Pauli anticommutations and nonadjacent vertices contribute none.
Local complementation at a vertex toggles every edge between neighbors of . It is implemented on graph states, up to global phase, by the local Clifford operator
The stabilizer subspace of a commuting family of Hermitian Pauli operators is
If there are independent generators on qubits, its dimension is .
For a stabilizer group , the orthogonal projector onto its stabilizer subspace is

Articles by others on the same topic (1)

Stabilizer (group) by Ciro Santilli 40 Updated 2025-07-16
Suppose we have a given permutation group that acts on a set of n elements.
If we pick k elements of the set, the stabilizer subgroup of those k elements is a subgroup of the given permutation group that keeps those elements unchanged.
Note that an analogous definition can be given for non-finite groups. Also note that the case for all finite groups is covered by the permutation definition since all groups are isomorphic to a subgroup of the symmetric group
TODO existence and uniqueness. Existence is obvious for the identity permutation, but proper subgroup likely does not exist in general.