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.
Phase aware n qubit pauli group
Definition
The displayed tensor powers are tensor maps on the ordered factors, using Tensor products of finitely many linear maps. Fix an integer . Let be the ordered tensor register of qubits from Ordered tensor registers, their inner product, and wire permutations, and let . We name the wires ; wire is position in the source's -based factor list. Bit tuples use the big-endian encoding from Big-endian encoding of ordered bit strings, so the first wire is the most significant bit. Write and for the tensor maps with the displayed one-qubit matrix on wire and the identity on every other wire. For , set and , where an exponent means the identity on that factor and an exponent means the displayed Pauli matrix. For , define
The phase-aware -qubit Pauli set is the set of these operators with matrix multiplication. Its scalar subset is . The product-and-adjoint theorem proves that is a group and that is its center.
Remarks
The Pauli algebra theorem Pauli matrix algebra and trace identities verifies Y=iXZ, so the one-qubit Y is P(1,1,1). The phase coordinate is modulo 4; the binary label (x,z) alone is used only after quotienting by Z_n.
Depends on
- 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
- The Pauli matrices
- Pauli matrix algebra and trace identities
- Tensor products of finitely many linear maps
- Big-endian encoding of ordered bit strings
- Ordered tensor registers, their inner product, and wire permutations
Used by
- Exact generator-tableau simulator for stabilizer circuits Algorithm
- Stabilizer encoder by symplectic elimination Algorithm
- Binary Pauli label and quotient Definition
- Circuit-to-open-graph resource encoding with normalized transport rounds Definition
- Clifford normalizer Definition
- Pauli measurement branch semantics Definition
- Phase-aware binary Clifford tableau Definition
- Phase-aware stabilizer tableau Definition
- Stabilizer code space Definition
- Stabilizer subgroup Definition
- CNOT Pauli action Lemma
- Computational basis states have an extended stabilizer tableau Lemma
- Controlled-Z matching action on a Pauli frame Lemma
- Graph-state stabilizer generators Lemma
- Hadamard pauli action Lemma
- Phase gate pauli action Lemma
- Stabilizer labels form an isotropic space of the same rank Lemma
- CSS encoding dimension and commutation Theorem
- CSS syndrome correction Theorem
- Even-Majorana Ising exchanges normalize logical Paulis Theorem
- Hermitian Pauli phase criterion Theorem
- Pauli product and adjoint Theorem
- Stabilizer projector rank and code dimension Theorem
Dependency tree · two levels
38 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)