Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Operator error for the finite sine-prefix rotation table

Statement

Let T=2L≥2, and let WT(a,b) and ∣ΨT⟩ be as in Finite sine-window phase state. In the binary prefix tree, order the register bits from root to leaf. At level ℓ=0,…,L−1, each interval node [a,b) has midpoint m=(a+b)/2 and split r=WT(a,m)/WT(a,b). Apply Ry(2arcsin⁡r) to the next bit, controlled on the preceding prefix that names [a,b), encoding bit 1 as the left child and bit 0 as the right child. Starting from ∣0L⟩, this ideal prefix circuit prepares ∣ΨT⟩. If a finite state-preparation circuit contains N controlled Y rotations and each implemented rotation differs from its ideal rotation by operator norm at most δ, the product unitary differs from the ideal product by operator norm at most Nδ. In the OP5 table variant let ϵΨ>0, N=T−1 and δ=ϵΨ/(100T), so the preparation error is less than ϵΨ/100; using the same bound for its inverse gives the stated unpreparation cost.

Facts & Assumptions

Given: A finite list of controlled rotations and a per-rotation operator-error bound.

[F2]

The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: the norm of a finite sum is at most the sum of the norms.

[F3]

Sine chord and linear bounds: sin⁡x≤x for x≥0, and sin⁡x≥2x/π for 0≤x≤π/2.

[F4]

Parity and the Pythagorean identity for sine and cosine: sine is odd and sin⁡2u+cos⁡2u=1.

[F5]

The addition formulas for sine and cosine: the sine and cosine addition formulas hold; substituting them into the displayed rotation matrices gives the corresponding angle-addition rule.

[F6]

Finite sine-window phase state: the leaf weights are wτ=sin⁡2(π(τ+1/2)/T) and the target amplitudes are 2/Tsin⁡(π(τ+1/2)/T).

[F7]

Sine-window normalization and positive prefix weights: WT(0,T)=T/2, and every nonempty interval has positive mass.

Proof

1.1givenF1F3F4F5algebra

The real Y-rotation matrix is Ry(θ)=(cos⁡(θ/2)−sin⁡(θ/2)sin⁡(θ/2)cos⁡(θ/2)). For any unit vector x, [F5] and [F4] give ∥(Ry(β)−Ry(α))x∥2=∥(Ry(β−α)−I)x∥2=4sin⁡2((β−α)/4). Taking the supremum over unit x and using [F3] and [F4] yields ∥Ry(β)−Ry(α)∥≤∣β−α∣. A controlled rotation is block diagonal with identity and this rotation on its control subspaces, so its operator error obeys the same bound.

1.2givenF3F6F7F8algebrainduction

For each leaf τ, put xτ=π(τ+1/2)/T∈(0,π). If xτ≤π/2, [F3] gives sin⁡xτ≥2xτ/π>0; if xτ>π/2, [F8] reduces positivity to π−xτ∈(0,π/2) and the same bound. Thus each leaf weight is positive, and [F7] makes every split ratio lie in (0,1). The rotation sends ∣0⟩ to 1−r∣0⟩+r∣1⟩, so its branch amplitudes are exactly the square roots of the right- and left-child mass fractions. Induction from the root shows that leaf τ has amplitude wτ/WT(0,T)=2/Tsin⁡xτ, by [F6] and [F7]. With left encoded by 1, interval leaf τ has computational label T−1−τ. Its amplitude equals that of label τ because xT−1−τ=π−xτ and [F8] gives sin⁡xT−1−τ=sin⁡xτ. Hence the ideal circuit prepares ∣ΨT⟩.

2.1F1F2step 1.1step 1.2algebra∎

For products U~N⋯U~1 and UN⋯U1, insert and subtract one factor at a time. This writes their difference as a sum of N terms, each containing one U~j−Uj between unitary products. By [F1] the outer products preserve norm, and [F2] bounds the sum by Nδ. For ϵΨ>0, N=T−1 and δ=ϵΨ/(100T) this is less than ϵΨ/100. Applying the same estimate to the inverse rotation list, whose ideal angles are negated and whose synthesis uses the same per-angle tolerance, gives the same bound for inverse preparation.

Depends on

Used by

Dependency tree · two levels

39 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