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.
Hadamard pauli action
Statement
For a Hadamard gate on factor , conjugation swaps the binary coordinates and changes the phase exactly by modulo . In particular , , and .
Facts & Assumptions
Given: n is a positive integer, j is a factor index, the phase-aware Pauli convention is fixed, and the register factors are ordered.
The Pauli matrices: the explicit X,Y,Z matrices are defined in the ordered computational basis.
Pauli matrix algebra and trace identities: X,Y,Z are self-adjoint involutions, Y=iXZ, ZX=-XZ, and YZ=iX.
Exact one-qubit gates and rotations: H=(X+Z)/sqrt(2); its verification gives H*=H and H^2=I.
Tensor products of finitely many linear maps and Tensor maps preserve composition, identities, and adjoints: tensor maps act factorwise on elementary tensors, preserve composition, and have factorwise adjoints.
Ordered tensor registers, their inner product, and wire permutations: the register factors and product basis have the declared order.
Proof
Direct multiplication of the displayed matrices gives and . Since , conjugation preserves product order and gives .
On factor , ; all other tensor factors are unchanged by [F4] and [F5]. As , this is with , , and all other coordinates unchanged.
Depends on
Used by
- Stabilizer encoder by symplectic elimination Algorithm
- Adaptive J angle and Pauli-frame update Lemma
- Clifford circuits lift binary symplectic transvections Lemma
- Phase-aware tableau updates for Clifford generators Lemma
- Stabilizer encoder correctness Theorem
- Termination and gate count of symplectic stabilizer elimination Theorem
Dependency tree · two levels
37 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 Watrous, Understanding Quantum Information and Computation, Lesson 14 (standard reference, not scraped)
- Scott Aaronson and Daniel Gottesman, Improved Simulation of Stabilizer Circuits (standard reference, not scraped)