Alphabeta Math
Pipeline-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.

✓ 1 result · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 1 also cleared it.

Quantum Signal Processing — Examples

1 · Prerequisites

2 · Summary

The example multiplies the degree-one zero-phase sequence explicitly, checks its parity and complement identity, and verifies both endpoint matrices without dividing by the vanishing off-diagonal signal.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: Literature-sourcedVerification: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Degree-one QSP phase identity

Example

Take d=1 and phases ϕ0=ϕ1=0. Then Z(0)=I and the sequence is U(x)=WR(x).

Facts & Assumptions

Given: x∈[−1,1], s=1−x2≥0, and the definitions of WR, Z, and the degree-one QSP matrix in QSP signal matrix and ordered phase sequence.

[F1]

QSP signal matrix and ordered phase sequence: WR(x)=(xss−x), Z(0)=I, and the length-one sequence is Z(0)WR(x)Z(0).

[F2]

Admissible polynomial pair for Hermitian-reflection QSP: an admissible pair has the declared degree/parity bounds and satisfies PP∗+(1−x2)QQ∗=1.

Verification

1.1F1algebra

Multiplying Z(0)WR(x)Z(0) gives U(x)=(xss−x). Thus the upper-left polynomial is P(x)=x and the upper-right entry is s(x)Q(x) with Q(x)=1.

2.1F2step 1.1algebra

The polynomial P has degree one and odd parity; Q is constant with degree zero and even parity. Also PP∗+(1−x2)QQ∗=x2+(1−x2)=1, so the pair is admissible by [F2].

3.1F1step 1.1algebra∎

At x=1 and x=−1, s(x)=0, so U(1)=diag⁡(1,−1) and U(−1)=diag⁡(−1,1). These are exactly the endpoint values from the displayed matrix, with no division by s(x) at either endpoint.

Sources