Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

Sparse diagonal block-encoded linear system

Example

Let A=diag⁡(1,1/2), α=1, γ=δ=1/2, and ∣b⟩ be either basis vector. Take the exact one-ancilla block encoding S=I−A2=diag⁡(0,3/2),U=(ASS−A). For the inverse target use the odd polynomial p(x)=x/2, degree one, and error e=1/4. A supplied real-QSVT extraction phase list is Φ=(0,π/3) together with its conjugate list −Φ.

Facts & Assumptions

Given: The matrix, block, input states, δ=1/2, and the supplied phase lists specified in the Example.

[F1]

Finite block encoding: the block encoding is exact when the all-zero ancilla compression equals A/α and the encoding unitary is unitary.

[F2]

QSP signal matrix and ordered phase sequence: WR(x)=(x1−x21−x2−x) and a degree-one sequence is Z(ϕ0)WR(x)Z(ϕ1) with Z(ϕ)=diag⁡(eiϕ,e−iϕ).

[F3]

QSVT action on singular subspaces: the coherent Φ/−Φ extraction has compressed block equal to the singular-value transform of the real part of the upper-left polynomial.

Verification

1.1givenF1algebra

The matrices A,S are self-adjoint, commute, and satisfy A2+S2=I. Thus U∗=U and U2=(A2+S2AS−SASA−ASS2+A2)=I. The all-zero ancilla compression of U is its top-left block A, so [F1] gives an exact (1,1,0) block encoding.

1.2givenalgebra

The diagonal entries of A are its singular values. Both inputs are supported on singular values at least γ=1/2, and ∥A∥op=α=1, so δ=γ/α=1/2. For x∈[1/2,1], −x≤2x2−1≤x because 2x2+x−1=(2x−1)(x+1)≥0 and x−(2x2−1)=(1−x)(2x+1)≥0. Hence ∣p(x)−δ/(2x)∣=∣2x2−1∣/(4x)≤1/4. Also p is odd, has degree one, satisfies p(0)=0, and ∣p(x)∣≤1/2 on [−1,1].

1.3givenF2F3algebra

For Φ=(0,π/3), [F2] gives upper-left entry eiπ/3x; the conjugate list gives e−iπ/3x. Their coherent real extraction is 12(eiπ/3+e−iπ/3)x=12x=p(x) by [F3]. Thus the exact response multipliers on the two singular vectors are p(1)=1/2 and p(1/2)=1/4.

2.1F1F3step 1.2step 1.3algebra∎

For ∣b⟩=∣0⟩, the QSVT success probability is ∣p(1)∣2=1/4 and the ideal inverse-block probability is ∣(δ/2)(1/1)∣2=1/16. For ∣b⟩=∣1⟩, these probabilities are ∣p(1/2)∣2=1/16 and ∣(δ/2)(1/(1/2))∣2=1/4. Each successful state is the same basis vector as the normalized QLSP solution because the singular space is one-dimensional and both multipliers are positive. For the optional Bernstein reciprocal check, set x=(1+u)/2 for 0≤u≤1. Then the two polynomials are 14(2x2+x−1)=18(3u+u2) and 14(1+x−2x2)=18(2−u−u2), with degree-two Bernstein coefficient lists (0,3/16,1/2) and (1/4,3/16,0). All coefficients are nonnegative, so the finite reciprocal certificate is valid.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

37 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