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.

Graph state is the unique joint stabilizer ray

Statement

Let G=(V,E) be an ordered finite simple graph on n vertices, let ∣G⟩ be its graph state, and let Kv=Xv∏u∈N(v)Zu be the generators from Graph-state stabilizer generators. Their common +1 eigenspace is exactly span⁡{∣G⟩}. If SG is the subgroup they generate, its orthogonal projector is

ΠG=2−n∑g∈SGg=∣G⟩⟨G∣.

For V=∅, SG={I} and the formula is the identity projector on the one-dimensional trivial register.

Facts & Assumptions

Given: A finite ordered simple graph, its graph state and stabilizer generators.

[F1]

The Kv are commuting Hermitian involutions, fix ∣G⟩, and have independent binary Pauli labels (Graph-state stabilizer generators).

[F2]

The graph-state Definition is the finite controlled-Z edge product applied to ∣+⟩⊗V (Graph state of an ordered finite simple graph).

[F3]

The average ∣S∣−1∑g∈Sg is the orthogonal projector onto the common +1 fixed space (Stabilizer average is the fixed-space projector).

[F4]

For a rank-r stabilizer subgroup on n qubits, the fixed-space projector has rank 2n−r (Stabilizer projector rank and code dimension).

[F5]

Every edge gate is the unitary diagonal matrix diag⁡(1,1,1,−1) (Controlled Phase Rotation).

[F6]

The product inner product makes the norm of an elementary tensor the product of factor norms, and the empty tensor register is C (Ordered tensor registers, their inner product, and wire permutations).

[F7]

A stabilizer subgroup is a finite abelian subgroup of the phase-aware Pauli group that contains no −I (Stabilizer subgroup).

[F8]

The ordered computational basis of C2 is orthonormal (The computational basis is orthonormal).

[F9]

The rank-one Dirac operator ∣u⟩⟨u∣ acts by z↦⟨z,u⟩u in the root-linear-first convention (Dirac Notation Conversion).

Proof

1.1F2F5F6F8algebracases

The vector ∣+⟩=2−1/2(∣0⟩+∣1⟩) has norm one by [F8], and ∣+⟩⊗V has norm one by the product inner product [F6]. Every edge gate in [F2] is unitary by [F5], so their finite product preserves norm and ∣G⟩ is a unit vector. When V=∅, the empty tensor and edge product give the unit vector 1∈C directly.

2.1F1F7step 1.1algebra

If n>0, every product of the commuting involutions in [F1] is indexed by a subset of the n generators. Its binary X-support is the indicator of that subset, so the independent labels in [F1] make the 2n products distinct. Every product fixes the nonzero vector ∣G⟩ from step 1.1, so the generated group cannot contain −I. It is a stabilizer subgroup by [F7] and has rank n.

3.1F1F3F4F9step 1.1step 2.1algebracases∎

For n>0, apply [F3] to the subgroup in step 2.1 to identify its group average with the common +1 projector. Its rank is 2n−n=1 by [F4]. The graph state fixes this line by [F1] and is unit by step 1.1, so the orthogonal projector onto the line is ∣G⟩⟨G∣ by [F9]. If n=0, the empty generator family generates {I}, whose average is the identity on C; this is also ∣1⟩⟨1∣.

Depends on

Used by

Nothing in the library uses this result yet.

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