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.
CNOT Pauli action
Statement
Let and let distinct be control and target indices. For CNOT acting on by toggling coordinate by , conjugation sends
with all other coordinates unchanged and additions in . In particular, , , , and ; the phase coordinate is unchanged in the fixed order.
Facts & Assumptions
Given: , distinct control and target wires , the ordered computational basis, and the phase-aware Pauli convention.
The Pauli matrices: X flips a one-bit computational basis vector and Z multiplies it by (-1)^b.
Pauli matrix algebra and trace identities: X and Z are Hermitian involutions.
Controlled Unitary Access: controlled access has control-first block form C(U)=diag(I,U).
CNOT and Control-Target Order: on the first two wires, CNOT sends |a,t> to |a,t+a> with first wire control.
Ordered tensor registers, their inner product, and wire permutations, Tensor products of finitely many linear maps, and Tensor maps preserve composition, identities, and adjoints: the ordered product basis and tensor maps extend local actions factorwise and preserve products.
Ordered tensor registers, their inner product, and wire permutations: a wire permutation is the unique linear extension of the corresponding permutation of ordered product-basis vectors.
Proof
For control and target , the controlled-X definition [F3,F4] gives . Applying this rule twice gives ; it permutes the ordered orthonormal basis, so . On a basis vector, in the right CNOT first changes to , the middle changes to , and the left CNOT changes the target to . Thus . In , the right CNOT changes the target to , the middle toggles it, and the left CNOT toggles it back by , leaving ; hence . The middle contributes and the two CNOTs restore the bits, giving . The middle contributes , giving .
For arbitrary distinct wires , assign source positions to . This partial assignment is injective; list its remaining source and target positions in increasing order and match them in order to extend it to a permutation . By [F6], moves those factors into the first two positions and permutes an orthonormal basis bijectively, so is unitary. The operator therefore has the stated basis action, and its Pauli conjugation rules are the first-two-wire rules of step 1.1 with local wire names replaced by .
Write as its ordered product of all -factor maps followed by all -factor maps. Conjugation preserves this product order. Using step 2.1, the images of the factors combine to with all other exponents unchanged; the images of the factors combine to with all other exponents unchanged. Tensor-map composition in [F5] justifies these factorwise products, and no factor is moved past a factor. Thus no scalar is introduced, is unchanged, and the stated binary updates follow.
Depends on
- Phase aware n qubit pauli group
- The Pauli matrices
- Pauli matrix algebra and trace identities
- Controlled Unitary Access
- CNOT and Control-Target Order
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- Tensor maps preserve composition, identities, and adjoints
Used by
Dependency tree · two levels
35 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)