Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Stabilizer projector rank and code dimension

Statement

Let S be a stabilizer subgroup on n qubits of rank r, and let ΠS be its fixed-space projector. Then

Tr⁡(ΠS)=dim⁡Cim⁡ΠS=2n∣S∣=2n−r.

In particular, if r=n, then C(S) is one-dimensional; for arbitrary r it is the 2n−r-dimensional stabilizer code space.

Facts & Assumptions

Given: An n-qubit stabilizer subgroup S of rank r.

[F1]

Stabilizer average is the fixed-space projector: ΠS is an idempotent whose image is C(S).

[F2]

Stabilizer labels form an isotropic space of the same rank: ∣S∣=2r, and the identity is the unique element with zero binary label.

[F3]

The Pauli matrices: in the ordered computational basis, X=(0110) and Z=(100−1).

[F4]

Phase aware n qubit pauli group: for n≥1, P(k,x,z)=ikXxZz in the fixed tensor order.

[F5]

Tensor products of finitely many linear maps: tensor products of operators act factorwise on elementary tensor vectors.

[F6]

Ordered tensor registers, their inner product, and wire permutations: the ordered computational basis is the lexicographically ordered product basis of the tensor factors, and the zero-qubit register is C.

[F7]

Pauli group on the empty register and Stabilizer subgroup: when n=0, the only stabilizer subgroup element is IC.

[F9]

The trace of an idempotent is its rank as a field scalar: for an idempotent on a finite-dimensional complex space, its trace is its image dimension viewed as a scalar.

[F10]

A maximal stabilizer label space is self-dual: an isotropic stabilizer label space of dimension r satisfies r≤n.

[F11]

Proof

Given: The data in the Statement.

1.1F1F2F3F4F5F6F7F8F10F11givenalgebra

By [F1], [F2], and [F10], 0≤r≤n and Tr⁡(ΠS)=∣S∣−1∑g∈STr⁡(g). For n>0, the identity is I⊗n. In the ordered product basis [F5]–[F6], its trace is a sum over bit words; [F11] factors this finite sum into the product of its one-qubit diagonal sums, each equal to 2. Thus its trace is 2n. When n=0, [F6]–[F8] give trace 1=20. For n>0, every other g∈S has nonzero binary label by [F2], hence at least one nonidentity tensor factor. By [F4] that factor is a scalar multiple of X, Z, or XZ. For any tensor Pauli, its trace is the sum over bit words of products of one-qubit diagonal coefficients; [F11] factors this finite sum into the product of the one-qubit traces. By [F3], X and XZ are off-diagonal, while Z has diagonal entries 1,−1, so the nonidentity factor has trace zero. Hence every such g has trace zero. Therefore Tr⁡(ΠS)=2n/∣S∣=2n−r.

2.1F1F9step 1.1

As ΠS is idempotent, [F9] gives Tr⁡(ΠS)=dim⁡Cim⁡ΠS. Combining with step 1.1 proves the dimension formula, including r=0 and r=n.

3.1step 2.1algebra∎

When r=n, step 2.1 gives a one-dimensional common fixed space, so the space is nonzero and all of its nonzero vectors determine the same ray. This is the existence and uniqueness assertion used in the definition of a pure stabilizer state.

Sources

Watrous Lesson 14 §14.3, printed pp. 420–422 (PDF pp. 426–428), expands commuting stabilizer projectors and computes code-space dimension. De Wolf §20.3, PDF pp. 187–188, gives the rank-n stabilizer-state and projector calculation. The local proof keeps the binary-label injectivity, finite tensor trace factorization, and trace-zero cases explicit.

Depends on

Used by

Dependency tree · two levels

52 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources