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.
An anticommuting stabilizer measurement is fair
Statement
Let be a pure stabilizer state density operator, and let be a Hermitian Pauli observable that anticommutes with one of its stabilizer generators. Then .
Facts & Assumptions
Given: A rank- stabilizer subgroup fixing the ray of , a normalized representative , and a Hermitian Pauli with for some .
Stabilizer state: every fixes .
Hermitian Pauli phase criterion: a Hermitian Pauli is self-adjoint and squares to .
Pauli measurement branch semantics: , and its probability on a pure state is .
Pure-state projective branch probability is a squared norm: for a unit vector and orthogonal projection , .
Ray-to-projector is well-defined and bijective: the projector of a unit representative of a pure-state ray is a positive trace-one density operator.
Pauli measurement projectors and total probability: are orthogonal complementary projections.
Proof
Given: The data in the Statement.
Since and by [F2], it is unitary. From and , we get and . Hence .
By [F5], the unit ray projector is a density operator, so its branch law [F3] and the norm identity [F4] give . The complementary orthogonal projections in [F6] satisfy , so equal probabilities must both be .
This proves that each outcome bit has probability .
Sources
De Wolf §20.3, PDF p. 188, proves equality of the two outcome probabilities by conjugating with an anticommuting stabilizer. Aaronson–Gottesman §III, PDF pp. 4–5, gives the corresponding tableau measurement case.
Depends on
Used by
Dependency tree · two levels
33 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, §20.3 (standard reference, not scraped)
- Scott Aaronson and Daniel Gottesman, Improved Simulation of Stabilizer Circuits, §III (standard reference, not scraped)