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.

Explicit median confidence guarantee for amplitude estimation

Statement

For rational 0<ϵ≤1 and 0<δ<1, the median procedure of Median confidence amplification for amplitude estimation returns a~ with ∣a~−a∣≤ϵ with probability at least 1−δ.

Both rational scheduling loops terminate at their least prescribed values, and the odd finite list has a well-defined exact algebraic middle order statistic. Its phase-register size is admissible for the one-run estimator; preparations, queries and comparison bit work retain their separately declared costs.

Facts & Assumptions

Given: The median algorithm, its rational ϵ,δ, and the one-run amplitude estimator.

[F1]

The median algorithm uses M≥88/(7ϵ) and odd r with 2r≥(2/δ)8 (Median confidence amplification for amplitude estimation).

[F2]

A one-run estimate has error at most π/M+π2/M2 with probability at least 8/π2 (Amplitude-estimation additive error and success probability).

[F3]

Independent Bernoulli variables satisfy Pr⁡(∣S−ES∣≥u)≤2e−2u2/r for r trials (Chernoff bound for independent bernoulli trials).

[F4]

8/π2>98/121 from π<22/7 (Rational bounds for pi used in finite schedules).

[F6]

The natural logarithm is strictly increasing, satisfies ln⁡(xy)=ln⁡x+ln⁡y and ln⁡(1/x)=−ln⁡x for positive inputs, and is inverse to the exponential (Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm, The natural logarithm as the inverse of the exponential function).

[F21]

The one-run QFT estimator has the finite output and access instructions stated in QFT-based amplitude estimation.

[F23]

Exact rational comparisons and output processing are charged as classical bit operations (Classical bit-operation cost).

[F24]

Independent repetitions mean separately prepared and measured runs in the quantum query model (Quantum query algorithm).

[F25]

Exact comparisons of real cyclotomic values terminate (Finite exact comparison of real cyclotomic values).

[F26]

The real field is Archimedean, natural powers obey 2j+1=2j⋅2, and induction holds on the naturals (Every complete ordered field is Archimedean, Exponentiation of natural numbers, mn, and its agreement with the integer power in R, The principle of mathematical induction).

Proof

1.1givenF22F23F26algebra

The threshold 88/(7ϵ) is rational and exceeds 4π/ϵ by [F22]. By [F26], powers of two are unbounded: choose a natural q above any fixed real threshold by the Archimedean property and use induction to get 2q≥q+1. Thus the doubling loop for M terminates, and its first value above the threshold is the least such power; since ϵ≤1 and 88/7>8, this value is at least 16, so it is an admissible phase-register size and satisfies the one-run precision requirement. The rational target (2/δ)8 is finite. Choose a natural q>(2/δ)8 by [F26]; if q is odd take r=q, and if q is even take r=q+1. Then r is positive odd and 2r≥2q≥q+1>(2/δ)8, so the odd-increment loop for r terminates at the least positive odd solution. Each comparison is exact rational arithmetic after clearing denominators.

1.2givenF21F23F24F25algebra

Each run returns an algebraic estimate in the same real cyclotomic field Q(ζM+ζM−1). Exact finite comparisons determine the middle order statistic; repetitions use independent fresh preparations and readouts by [F24].

1.3givenF1F2F4algebra

From [F1]–[F2] and ϵ≤1, a good run has error at most ϵ/4+ϵ2/16≤5ϵ/16<ϵ. Its success probability is at least p=8/π2>p0:=98/121, so each failure indicator has mean at most 1−p0.

2.1givenF23step 1.1step 1.2

The output is one of the r finite run estimates, and the odd sample size makes its middle index unique. Thus the procedure is defined for all stated rational inputs, with query and classical comparison costs remaining separate under [F23].

2.2givenF3step 1.3algebra

If the median lies outside [a−ϵ,a+ϵ], at least (r+1)/2 runs are failures. For their sum S, this entails S−ES≥r(p0−1/2). Applying the two-sided additive bound [F3] to this containing event gives probability at most 2exp⁡(−2r(p0−1/2)2).

3.1givenF1F5F6step 2.2algebra∎

Here p0−1/2=75/242 and c=2(75/242)2=5625/29282, so 8c>1. By [F6], monotonicity and the logarithm product law turn 2r≥(2/δ)8 into rln⁡2≥8ln⁡(2/δ). Put L=ln⁡(2/δ)>0. By [F5], 0<ln⁡2<1, so r>8L and hence cr>8cL>L. The reciprocal law in [F6] gives ln⁡(δ/2)=−L, while the inverse identity gives ln⁡(e−cr)=−cr<ln⁡(δ/2). Strict increase of ln⁡ therefore implies 2e−cr<δ. Step 2.2 bounds median failure by this quantity, proving success at least 1−δ.

Depends on

Used by

Cited to discharge well-definedness by Median confidence amplification for amplitude estimation.

Dependency tree · two levels

102 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