Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 stabilizer tableau

Definition

For n≥0, x,z∈F2n, and k∈Z/4, write P(k,x,z)=ikXxZz, with the fixed tensor order and Xx=⨂j<nXxj, Zz=⨂j<nZzj. A row (k,x,z) is Hermitian when k≡x⋅z(mod2); it stores the exact Pauli phase as well as its binary label (x,z).

For n=0, use the scalar Pauli convention of Pauli group on the empty register; the generator list is empty.

A generator tableau is an ordered list of n Hermitian rows whose Pauli operators commute, have linearly independent labels, and generate a subgroup not containing −I. It represents the unique common +1 ray when the rows stabilize a pure state. An extended tableau also stores Hermitian destabilizer rows d1,…,dn and stabilizer rows s1,…,sn with

ω(di,sj)=δij,ω(di,dj)=0,ω(si,sj)=0.

The exact phase and symplectic conventions are those of the cited Pauli suppliers. The generator-only simulator uses the sj rows; the extended pairing is retained as a second representation invariant.

Sources

Aaronson–Gottesman §III, PDF pp. 3–5, defines the phase-bit tableau and its destabilizer/stabilizer pairing. De Wolf §20.3, PDF pp. 187–188, gives the generator-only stabilizer representation used by the simulator: https://arxiv.org/pdf/quant-ph/0406196; https://arxiv.org/pdf/1907.09415.

Depends on

Used by

Dependency tree · two levels

24 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