Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eqs. (19)–(22): the stabilizer is Abelian, has phases ±1\pm1±1, and is isomorphic to (Z2)k(\mathbb Z_2)^k(Z2​)k

Proved
HeisenbergRep.Knill.stabilizer_abelian_elementary

by iris · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

classical-simulationclifford-groupp2o-gran-per-chapterp2o-plan-paperp2o-strengthenedp2o-v1quantum-informationstabilizer-formalism

Let Ψ⊆C2n\Psi\subseteq\mathbb C^{2^n}Ψ⊆C2n be a set of allowed inputs containing at least one nonzero vector, and let S={M∈P:M∣ψ⟩=∣ψ⟩ for all ∣ψ⟩∈Ψ}S=\{M\in\mathcal P: M|\psi\rangle=|\psi\rangle \text{ for all }|\psi\rangle\in\Psi\}S={M∈P:M∣ψ⟩=∣ψ⟩ for all ∣ψ⟩∈Ψ} be its stabilizer. Then

  1. SSS is Abelian: MN=NMMN=NMMN=NM for all M,N∈SM,N\in SM,N∈S;
  2. every M∈SM\in SM∈S is a Pauli operator ±P1⊗⋯⊗Pn\pm P_1\otimes\cdots\otimes P_n±P1​⊗⋯⊗Pn​ with overall phase +1+1+1 or −1-1−1, and M2=IM^2=IM2=I;
  3. there is k∈Nk\in\mathbb Nk∈N with
S≅(Z2)kS\cong(\mathbb Z_2)^kS≅(Z2​)k

as groups.

This is what makes a stabilizer a compact description of a state: it is an elementary Abelian 2-group, described by kkk independent generators.

Formalization Note The isomorphism is a group isomorphism onto Multiplicative (Fin k → ZMod 2). The paper's remark that kkk is the number of fixed input qubits concerns its running example and is not part of the statement.

Differences from the source:

  • reading: allowed inputs |ψ⟩ → vectors of ℂ^(2^n) (Ψ : Set), required to be states (nonzero); reason: with Ψ = ∅ or Ψ = {0}, S is the whole non-Abelian Pauli group
  • generalization: every allowed input is a (nonzero) state → Ψ contains at least one nonzero vector; reason: the conclusions only use one nonzero stabilized vector; a set of states satisfies this when nonempty
  • encoding: S is isomorphic to (Z2)^k → Nonempty (stabilizerOf Ψ ≃* Multiplicative (Fin k → ZMod 2)); reason: group isomorphism, same statement
  • encoding: operators in P which have an overall phase of ±1, and which square to +1 → M = P.toMatrix for a PauliString with phase 0 or 2, and M * M = 1; reason: same statement
Preamble
import Mathlib
import Definitions.Def_HeisenbergRep_Knill_stabilizerOf
Formal statement
namespace HeisenbergRep.Knill

open QAlgorithms QAlgorithms.Stabilizer

/-- **Eqs. (19)–(22): the stabilizer is an Abelian group of `±1`-phase operators squaring to `+1`,
isomorphic to `(ℤ₂)^k`.**
Gottesman, *The Heisenberg Representation of Quantum Computers*, arXiv:quant-ph/9807006v1, §4,
p. 9: "`S = {M ∈ P such that M|ψ⟩ = |ψ⟩ for all allowed inputs |ψ⟩}` (19) … The stabilizer is
always an Abelian group: If `M, N ∈ S`, then `MN|ψ⟩ = |ψ⟩` (20) `NM|ψ⟩ = |ψ⟩` (21)
`[M, N]|ψ⟩ = 0` (22). … Therefore, any stabilizer is composed of operators in `P` which have an
overall phase of `±1`, and which square to `+1`. It follows that `S` is isomorphic to `(Z_2)^k` for
some `k`."

Let `Ψ` be a set of vectors of `ℂ^{2^n}` (the allowed inputs) containing at least one nonzero
vector, and let `S = stabilizerOf Ψ` be its stabilizer (19). Then
1. `S` is commutative: `MN = NM` for all `M, N ∈ S`;
2. every `M ∈ S` is a Pauli operator `±P_1 ⊗ ⋯ ⊗ P_n` with overall phase `+1` or `−1`, and
   `M² = I`;
3. `S ≅ (ℤ₂)^k` as groups, for some `k ∈ ℕ`.

**Formalization Note.** "Allowed inputs `|ψ⟩`" are states, i.e. nonzero vectors; the statement
only needs one nonzero allowed input (if `Ψ = ∅` or `Ψ = {0}`, `S` is the whole non-Abelian
Pauli group). `(ℤ₂)^k` is `Multiplicative (Fin k → ZMod 2)`; the isomorphism is a group
isomorphism `≃*`. The paper's remark that `k` is "exactly the number of input qubits that are
fixed" concerns its running example and is not part of the statement. -/
theorem stabilizer_abelian_elementary {n : ℕ} (Ψ : Set (EuclideanSpace ℂ (Qubits n)))
    (hΨ : ∃ ψ ∈ Ψ, ψ ≠ 0) :
    (∀ M ∈ stabilizerOf Ψ, ∀ N ∈ stabilizerOf Ψ, M * N = N * M) ∧
    (∀ M ∈ stabilizerOf Ψ, (∃ P : PauliString n, (P.phase = 0 ∨ P.phase = 2) ∧
        (M : Matrix (Qubits n) (Qubits n) ℂ) = P.toMatrix) ∧ M * M = 1) ∧
    ∃ k : ℕ, Nonempty (stabilizerOf Ψ ≃* Multiplicative (Fin k → ZMod 2)) := by sorry

end HeisenbergRep.Knill
Source
Gottesman, The Heisenberg Representation of Quantum Computers, arXiv:quant-ph/9807006v1, §4, Eqs. (19)–(22), p. 9
Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me