Alphabeta Math
TheoremStatement: 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.

Amplitude-estimation additive error and success probability

Statement

For the QFT-based estimator with M=2m≥4 and integer k≥1, its output satisfies ∣a~−a∣≤2πka(1−a)M+π2k2M2 with probability at least 8/π2 when k=1, and with probability strictly greater than 1−1/[2(k−1)] when k≥2. In particular the k=1 error is at most π/M+π2/M2. At a=0 the output is exactly zero; at a=1 it is exactly one.

For every allowed access instance and M=2m≥4, the prescribed signed controlled circuit and its exact real cyclotomic output are well-defined, retaining the controlled relative phase and separately charged classical output processing.

Facts & Assumptions

Given: The amplitude task, QFT estimator with M=2m≥4, and integer k≥1.

[F1]

The estimator returns sin⁡2(πy/M) after QPE on the Grover iterate (QFT-based amplitude estimation).

[F2]

The Grover eigenphases are ±θ/π modulo one with equal weights, where a=sin⁡2θ (Grover eigenphases encode the good probability).

[F3]

The floor and ceiling phase labels have combined probability at least 8/π2 (Two nearest phase labels carry probability at least eight over pi squared).

[F4]

The QPE tail for K=⌊Mη⌋≥2 is at most 1/[2(K−1)], and exact-grid phases are returned with certainty (Phase-estimation nearest-grid and tail bounds).

[F5]

For f(x)=sin⁡2x, f′(x)=sin⁡(2x) (The derivatives of sine and cosine are cosine and minus sine, The addition formulas for sine and cosine).

[F6]

Sine is 1-Lipschitz, so ∣sin⁡u−sin⁡v∣≤∣u−v∣ (Sine and cosine are 1-Lipschitz on R).

[F7]

The fundamental theorem of calculus evaluates increments of a continuously differentiable function by integrating its derivative (The first fundamental theorem: if f is integrable on [a,b] and continuous at c, then F′(c)=f(c); in particular a continuous f has F as a primitive).

[F8]

The finite QPE outcome probability is Pϕ(y)=M−2∣∑j=0M−1e2πij(ϕ−y/M)∣2 (Phase-estimation finite outcome law).

[F9]

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

[F10]

Circular phase distance takes values in [0,1/2] and identifies the two arcs from a phase to a label (Circular phase distance modulo one).

[F11]

For 0≤u≤1/2, sin⁡(πu)≥2u (Sine chord and linear bounds).

[F12]

Euler's identity gives eit=cos⁡t+isin⁡t and ∣eit∣=1 (exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0).

[F13]

The complex modulus is multiplicative and satisfies ∣z+w∣≤∣z∣+∣w∣ (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F14]

Sine is odd, cosine is even, and sin⁡2x+cos⁡2x=1 (Parity and the Pythagorean identity for sine and cosine).

[F15]

The integer part j=⌊Md⌋ satisfies j≤Md<j+1 (Integer part: for every real x there is exactly one integer m with m≤x<m+1).

[F16]

On a superposition of eigenspaces, QPE outcome probabilities are the eigenphase-weighted mixture, with no cross terms (Phase estimation on a superposition of eigenspaces).

[F18]

Sine changes sign under a shift by π, and the supplementary identity is sin⁡(π−x)=sin⁡x; iterating the shift gives sin⁡(u−qπ)=(−1)qsin⁡u for every integer q (Quarter-turn values and shifts by pi/2 and pi, Cofunction, supplementary, quarter-turn, and reflection identities for the six trigonometric functions).

[F21]

The two Grover eigenphases are θ/π and 1−θ/π, with equal weights in the prepared state for 0<a<1 (Grover eigenphases encode the good probability).

[F22]

QPE uses controlled positive powers and a projective readout of its M-label register (Quantum phase estimation).

[F23]

Controlled and inverse access are explicit capabilities. In repeated-unitary mode the task expands C(Q) into its controlled factors; in power-query mode each supplied C(Q2j) is a declared query with its own cost vector, including any constituent implementations used (Controlled Unitary Access, Inverse Unitary Access, Amplitude estimation and counting input/output contract).

[F24]

A standalone global phase leaves outcome probabilities invariant, but a controlled global phase is a relative phase on the control (Standalone Global Phase Leaves Pure-State POVM Probabilities Unchanged, A Controlled Global Phase Becomes a Relative Control Phase).

[F25]

The signed reflections in Q are unitary involutions (Projector Reflections Are Hermitian Unitary Involutions).

[F26]

The phase-estimation access theorem counts m supplied controlled-power queries or M−1 repeated controlled-Q calls (Phase-estimation query and gate costs).

[F27]

Classical algebraic encoding and any decimal refinement are charged separately (Classical bit-operation cost).

[F28]

A real value P(ζM) with ζM=e2πi/M has the exact real cyclotomic representation and comparison interface of Finite exact comparison of real cyclotomic values.

Proof

1.1givenF21F22

By [F21], the input state lies in the span of eigenvectors of Q with phases θ/π and 1−θ/π; the endpoint cases are single eigenphases. QPE is therefore applied to its finite eigenphase decomposition, and the projective measurement returns a label in the finite set {0,…,M−1} by [F22].

1.2givenF23F24F25

In repeated-unitary mode, the task contract expands each controlled Q as C(−I)C(A)C(S0)C(A∗)C(Sgood), with every factor supplied or implemented and charged. In power-query mode the estimator instead uses the supplied controlled powers as declared queries, each with its own cost vector; it does not require separately supplied controlled A or A∗. The scalar minus is invisible only in an uncontrolled call by [F24], while under control it is retained as a relative phase. The reflection factors are unitary by [F25]. Thus the circuit instructions are well-defined under either declared access mode.

1.3givenF26F27F28algebra

For ζM=e2πi/M, Euler's formula gives sin⁡2(πy/M)=(1−cos⁡(2πy/M))/2=(2−ζMy−ζM−y)/4. This is a real algebraic element of the cyclotomic field, so the stated output is exactly encoded; query counts are those in [F26] and decimal/bit processing is charged under [F27].

1.4givenF1F2F5F6F7F14F18algebra

Let f(x)=sin⁡2x and first suppose 0<a<1. Fix one Grover eigenphase ϕ∈{θ/π,1−θ/π}, put x=πϕ, and let d=dT(ϕ−y/M). The difference belongs to (−1,1), so there are an integer q and σ∈{−1,1} with ϕ−y/M=q+σd. Hence πy/M=x−qπ−σπd. By the integer π-shift identity [F18], the estimator output is sin⁡2(πy/M)=f(x+h) for h=−σπd. On either eigenphase, f(x)=a: the first has x=θ, and the second has x=π−θ and uses the supplementary identity [F18]. Also f′(x)=sin⁡(2x) by [F5], and ∣f′(x)∣=2a(1−a) on both branches: the second branch has sin⁡(2π−2θ)=−sin⁡(2θ) by [F14] and [F18], while sin⁡2θ=a and cos⁡2θ=1−a by [F14]. For any real x,h, [F5] and [F7] give f(x+h)−f(x)−hf′(x)=∫0h(sin⁡(2x+2u)−sin⁡(2x)) du. By [F6], the integrand has absolute value at most 2∣u∣, so either orientation gives absolute remainder at most h2. On the phase-success event d≤k/M, hence ∣h∣≤πk/M, and the displayed error bound follows.

1.5givenF2F4F8F9F10F11F12F13F14F15F16F17algebra

Let k≥2 and fix one Grover eigenphase ϕ. For a tail outcome at distance d>0, write x=ϕ−y/M=ℓ±d by [F10]. Integer periodicity [F17] and sine parity [F14] reduce the denominator to ∣1−e2πid∣=2sin⁡(πd) by Euler [F12] and the sine addition formula. Thus [F8]–[F9] and [F12]–[F14] give Pϕ(y)=M−2∣1−e2πiM(ϕ−y/M)∣2/∣1−e2πi(ϕ−y/M)∣2≤1/(4M2d2), since the numerator modulus is at most 2 and the denominator is 2sin⁡(πd)≥4d by [F10]–[F11]. In the tail d≥k/M, put j=⌊Md⌋; [F15] gives k≤j≤⌊M/2⌋. Each annulus j≤Md<j+1 has at most two arcs of length 1/M, each containing at most one label on the 1/M grid. Thus the tail probability is at most 12∑j=k⌊M/2⌋j−2<12∑j=k⌊M/2⌋[j(j−1)]−1≤1/[2(k−1)]. An empty tail has probability zero, also strictly below this positive bound. This strengthens [F4], so success is strictly greater than 1−1/[2(k−1)] for each phase and hence for their mixture.

2.1givenF2F3F16step 1.4

For k=1, both labels from [F3] have circular distance at most 1/M from the relevant Grover phase. Off-grid, floor and ceiling labels have distances strictly below 1/M; on-grid the distance is zero. Thus the event used in step 1.4 has probability at least 8/π2.

3.1givenF1F2F4step 1.4algebra∎

At a=0 the Grover phase is the exact grid phase 0; at a=1 it is 1/2, whose label M/2 is integral because M is even. Exact-grid recovery [F4] gives outputs 0 and 1. Finally 2a(1−a)≤1 gives the stated k=1 simplification.

Depends on

Used by

Cited to discharge well-definedness by QFT-based amplitude estimation.

Dependency tree · two levels

178 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