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.

Quantum Phase Estimation — Examples

1 · Prerequisites

2 · Summary

The exact-grid example computes the complete output law for phase 5/8 with eight phase labels. The phase 3/16 example computes both tied nearest-label probabilities, lists the four circular-tail labels at threshold 1/4, and gives their exact total as 132(csc⁡2(5π/16)+csc⁡2(7π/16)), below the proved bound 1/2.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Exact estimation of a binary phase

Example

Take a valid eigenphase-estimation input with m=3 and eigenphase θ=5/8. Compute the complete output law and the returned estimate.

Facts & Assumptions

Given: A valid QPE eigenpair Uψ=exp⁡(2πi(5/8))ψ, with m=3.

[F1]

The algorithm returns the measured label y and estimate y/Q, where Q=2m (Quantum phase estimation).

[F2]

If Qθ=t is an integer, then the exact-grid theorem gives probability one to y=t and zero to every other label (Exact phase recovery on the QPE grid).

Verification

1.1givenF2algebra

Here Q=23=8 and Qθ=8(5/8)=5, an integer in {0,…,7}. By [F2], the output probabilities in label order 0,1,…,7 are (0,0,0,0,0,1,0,0).

2.1F1step 1.1algebra∎

The unique measured label is y=5; [F1] therefore returns the exact phase estimate y/Q=5/8.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Nearest-grid and tail estimates in phase estimation

Example

Take a valid eigenphase-estimation input with m=3, Q=8, and θ=3/16. Compute the nearest-label probabilities and the exact circular tail probability at threshold η=1/4.

Facts & Assumptions

Given: A valid QPE eigenpair with m=3, Q=8, and θ=3/16.

[F1]

The finite outcome law is Pθ(y)=Q−2∣∑j<Qexp⁡(2πij(θ−y/Q))∣2 (Phase-estimation finite outcome law).

[F2]

The geometric sum is (1−zQ)/(1−z) when z≠1 (Finite geometric sum for phase-estimation amplitudes).

[F3]

The circular distance is dT(x)=min⁡(∣x∣,1−∣x∣) for x∈[−1,1] (Circular phase distance modulo one).

[F4]

The success-and-tail theorem gives every nearest label probability at least 4/π2, and for K=⌊Qη⌋≥2 bounds the circular tail by 1/(2(K−1)) (Phase-estimation nearest-grid and tail bounds).

Verification

1.1givenF1F2F4algebra

Since Qθ=3/2, the grid labels 1 and 2 are tied nearest labels, each at circular distance 1/16. For y=1,2, Q(θ−y/8)=±1/2, so the geometric quotient in [F1]–[F2] has numerator modulus 2 and denominator modulus 2sin⁡(π/16). Thus Pθ(1)=Pθ(2)=1/(64sin⁡2(π/16)), which is at least 4/π2 by the nearest-grid part of [F4].

1.2F1F2F3algebra

The circular distances for y=0,…,7 are (3/16,1/16,1/16,3/16,5/16,7/16,7/16,5/16), by [F3]. Hence the tail event dT(θ−y/8)≥1/4 consists exactly of y=4,5,6,7. For these labels the exact outcome probabilities are Pθ(4)=Pθ(7)=1/(64sin⁡2(5π/16)) and Pθ(5)=Pθ(6)=1/(64sin⁡2(7π/16)), again by the finite geometric quotient.

2.1F4step 1.2algebra∎

Therefore the exact total tail is 132(sin⁡−2(5π/16)+sin⁡−2(7π/16)). Here K=⌊8(1/4)⌋=2, so [F4] gives the proven upper bound 1/2 for this total. Numerically the exact expression is approximately 0.07769, well below 1/2.

Sources