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.
Binary Pauli quotient isomorphism
Statement
The map , , is a surjective group homomorphism with kernel exactly . Therefore the quotient map in Binary Pauli label and quotient is an isomorphism , and . No phase or label ambiguity occurs, including when .
Facts & Assumptions
Given: , the ordered computational basis indexed by bit strings, and the phase-aware Pauli group; is the all-zero basis vector and is the bit string with its only in position .
Pauli product and adjoint: the exact product law adds binary labels, and the scalar center is Z_n.
Big-endian encoding of ordered bit strings and Big-endian bit-string indices are bijective: distinct bit strings index distinct ordered computational-basis vectors.
The Pauli matrices and Pauli matrix algebra and trace identities: the displayed X and Z matrices act on one-bit basis vectors by X|b〉=|b+1〉 and Z|b〉=(-1)^b|b〉.
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 product basis is ordered, tensor maps act factorwise, and their products compose factorwise.
Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis and Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis: a basis is an independent spanning family, and dimension is the size of a finite basis.
Proof
By the one-factor actions in [F3] and the factorwise tensor-map rules in [F4], . Distinct bit strings give distinct basis vectors by [F2], so the output basis index of the image of |0〉 is x.
Suppose for a nonzero scalar . Applying both sides to gives nonzero multiples of and ; distinct bit strings index distinct basis vectors by [F2], so . Comparing the coefficients of this common basis vector gives . Applying the operators to gives the common output basis vector with coefficients and ; their equality and the preceding phase equality imply for every . Thus operators equal up to scalar exactly when their binary labels agree; when , the same coefficient comparison gives modulo , so the exact parameter triple is unique.
The parameter uniqueness in step 2.1 makes an unambiguous map on operators. The product formula [F1] makes a homomorphism; its kernel is exactly the zero-label operators , and every is the image of . The scalar set is a subgroup because it contains and is closed under products and inverses; it is central by [F1]. Hence is an equivalence relation: , whenever , and whenever both factors lie in . Its class is the right coset , since exactly when for some . If representatives change from to with , centrality gives , so is well-defined. Step 2.1 makes the induced coset map injective, while gives surjectivity. It is therefore the asserted quotient isomorphism.
The 2n vectors (e_j,0) and (0,e_j) span V_n by coordinate expansion and are linearly independent because a zero linear combination has each x and z coordinate zero. They form a basis by [F5], so dim V_n=2n.
Depends on
- Binary Pauli label and quotient
- Pauli product and adjoint
- The Pauli matrices
- Pauli matrix algebra and trace identities
- Big-endian encoding of ordered bit strings
- Big-endian bit-string indices are bijective
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- Tensor maps preserve composition, identities, and adjoints
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- Finite fields and their order
- Vector space over a field
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
Used by
- Phase-aware binary Clifford tableau Definition
- Phase-aware stabilizer tableau Definition
- Stabilizer subgroup Definition
- Computational basis states have an extended stabilizer tableau Lemma
- Deterministic Pauli measurement on a pure stabilizer state 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
- Clifford induces symplectic map Theorem
- Clifford to binary symplectic action is surjective Theorem
- Dimension of the logical Pauli quotient Theorem
Cited to discharge well-definedness by Binary Pauli label and quotient.
Dependency tree · two levels
66 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
- John Preskill, Quantum Error Correction, Physics 229 Lecture Notes, Chapter 7 (standard reference, not scraped)
- M. Hein et al., Entanglement in Graph States and Its Applications (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)