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.
Pauli product and adjoint
Statement
For and , with and ordered as written,
where the dot product is first evaluated in as or , and then multiplied by in . The set is a group. If represents , then , and its center is .
Facts & Assumptions
Given: n>=1, the ordered register, and the phase-aware Pauli convention.
Pauli matrix algebra and trace identities: X and Z are Hermitian involutions and ZX=-XZ.
Tensor products of finitely many linear maps and Tensor maps preserve composition, identities, and adjoints: tensor maps act on elementary tensors, preserve composition, and take factorwise adjoints.
Ordered tensor registers, their inner product, and wire permutations: the tensor factors and product basis have a fixed order.
Proof
On one factor, , since the factors commute unless both exponents are , when by [F1]. Multiplying these identities over the ordered factors gives , where is the integer representative or of .
Substituting that reordering into gives , which is exactly the stated product formula; all binary exponents add modulo , while the phase exponent adds modulo .
The formula proves closure. is an identity, and associativity is inherited from matrix multiplication, so is a group once inverses are supplied below.
Taking the adjoint reverses the order and conjugates : , where represents . The product formula then gives , so this adjoint is the inverse and completes the group proof.
Scalar operators commute with every matrix and belong to . Conversely, if commutes with every , the product law forces for each ; commuting with every forces for each . Thus every central element is scalar and the center is exactly .
Depends on
Used by
- Stabilizer encoder by symplectic elimination Algorithm
- Binary Pauli label and quotient Definition
- Clifford normalizer Definition
- Phase-aware stabilizer tableau Definition
- Stabilizer subgroup Definition
- Clifford circuits lift binary symplectic transvections Lemma
- Random Pauli measurement updates stabilizer generators Lemma
- Stabilizer labels form an isotropic space of the same rank Lemma
- Tableau row reduction returns the deterministic Pauli sign Lemma
- Binary Pauli quotient isomorphism Theorem
- Hermitian Pauli phase criterion Theorem
- Pauli commutator is symplectic pairing Theorem
Cited to discharge well-definedness by Phase aware n qubit pauli group.
Dependency tree · two levels
31 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
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)
- John Preskill, Quantum Error Correction, Physics 229 Lecture Notes, Chapter 7 (standard reference, not scraped)
- Scott Aaronson and Daniel Gottesman, Improved Simulation of Stabilizer Circuits (standard reference, not scraped)