Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generated
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 n≥1. Let Hn=Q2⊗n be the ordered tensor register of n qubits from Ordered tensor registers, their inner product, and wire permutations, and let F2=Z/2Z. We name the wires 1,…,n; wire j is position j−1 in the source's 0-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 Xj and Zj for the tensor maps with the displayed one-qubit matrix on wire j and the identity on every other wire. For x,z∈F2n, set Xx=⨂j=1nXxj and Zz=⨂j=1nZzj, where an exponent 0 means the identity on that factor and an exponent 1 means the displayed Pauli matrix. For k∈Z/4Z, define

P(k,x,z):=ikXxZz.

The phase-aware n-qubit Pauli set Pn is the set of these operators with matrix multiplication. Its scalar subset is Zn:={ikIHn:k∈Z/4Z}. The product-and-adjoint theorem proves that Pn is a group and that Zn 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

Used by

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