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 be an ordered finite simple graph on vertices, let be its graph state, and let be the generators from Graph-state stabilizer generators. Their common eigenspace is exactly . If is the subgroup they generate, its orthogonal projector is
For , 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.
The are commuting Hermitian involutions, fix , and have independent binary Pauli labels (Graph-state stabilizer generators).
The graph-state Definition is the finite controlled- edge product applied to (Graph state of an ordered finite simple graph).
The average is the orthogonal projector onto the common fixed space (Stabilizer average is the fixed-space projector).
For a rank- stabilizer subgroup on qubits, the fixed-space projector has rank (Stabilizer projector rank and code dimension).
Every edge gate is the unitary diagonal matrix (Controlled Phase Rotation).
The product inner product makes the norm of an elementary tensor the product of factor norms, and the empty tensor register is (Ordered tensor registers, their inner product, and wire permutations).
A stabilizer subgroup is a finite abelian subgroup of the phase-aware Pauli group that contains no (Stabilizer subgroup).
The ordered computational basis of is orthonormal (The computational basis is orthonormal).
The rank-one Dirac operator acts by in the root-linear-first convention (Dirac Notation Conversion).
Proof
The vector has norm one by [F8], and 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 is a unit vector. When , the empty tensor and edge product give the unit vector directly.
If , every product of the commuting involutions in [F1] is indexed by a subset of the generators. Its binary -support is the indicator of that subset, so the independent labels in [F1] make the products distinct. Every product fixes the nonzero vector from step 1.1, so the generated group cannot contain . It is a stabilizer subgroup by [F7] and has rank .
For , apply [F3] to the subgroup in step 2.1 to identify its group average with the common projector. Its rank is 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 by [F9]. If , the empty generator family generates , whose average is the identity on ; this is also .
Depends on
- Graph state of an ordered finite simple graph
- Controlled Phase Rotation
- Ordered tensor registers, their inner product, and wire permutations
- The computational basis is orthonormal
- Stabilizer subgroup
- Graph-state stabilizer generators
- Stabilizer average is the fixed-space projector
- Stabilizer projector rank and code dimension
- Dirac Notation Conversion
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
- M. Hein et al., Entanglement in graph states and its applications, Proposition 3, p. 16 (standard reference, not scraped)
- Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel, Measurement-based quantum computation on cluster states, §§II B–C (standard reference, not scraped)