Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Exact success for known positive amplitude with explicit dilution

Statement

Under the exact access and rotation assumptions of Exact success amplification by attenuating the good branch, its output is good with probability 1 for every 0<a≤1. The a=0 branch returns fail and makes no claim that a good output exists.

Facts & Assumptions

Given: The exact-success algorithm, its known weight a, and its supplied coherent flag operation, rotations, and the selected enlarged-reflection and terminal-instrument implementations.

[F1]

Exact success amplification by attenuating the good branch: for 0<a<1, the chosen m,θ′,r satisfy the displayed formulas, and every iterate uses the modified pair (A′,Π′) with the explicitly specified access modes.

[F2]

Exact success probability after amplitude amplification: a prepared state with good weight sin⁡2θ′ has good probability sin⁡2((2m+1)θ′) after m standard iterates.

[F3]

Projective measurement outcome weights are probabilities: the good measurement weight is the probability of that outcome.

[F4]

Conditional state for a projective measurement: on a positive-probability projective branch, the conditional state is supported in the measured projection range.

[F6]

The derivatives of sine and cosine are cosine and minus sine, Cosine has a smallest positive zero, lying strictly between zero and two, and Pi as twice the smallest positive zero of cosine: sin⁡′=cos⁡, and cosine is positive before its first positive zero π/2; hence sine is increasing on [0,π/2].

Proof

1.1givenF1F6algebra

The algorithm sets m=⌈π/(4θ)−1/2⌉, so m≥π/(4θ)−1/2. Multiplying by 4θ>0 gives 4mθ+2θ≥π, hence 4m+2≥π/θ and 0<θ′=π/(4m+2)≤θ<π/2. By sine monotonicity in [F6], 0<sin⁡2θ′≤sin⁡2θ=a, so 0<r=sin⁡2θ′/a≤1 and the two nonnegative square roots used in the supplied flag rotation are defined.

1.2givenF1constructalgebra

In the constructed zero reflection, on fixed logical flag/temporary bits f,t, the four X gates and two Toffolis compute and then erase q=(1−f)(1−t). The data sees S0 exactly when f=t=0, and identity otherwise. This is I−2∣0⟩⟨0∣H⊗∣00⟩⟨00∣F,T=S0′. In the constructed good reflection, split any data vector as vg+vb with vg=Πgoodv. The first flag call records 1 on vg and 0 on vb in q; CZ(q,F) multiplies only vg with F=1 by −1, and the inverse flag call clears q. Thus it is I−2Πgood⊗∣1⟩⟨1∣F⊗IT=Sgood′ for arbitrary T. Linearity extends both calculations to every logical vector with clean external scratch. Direct modes supply these same operators by hypothesis.

1.3givenF1F3F4constructalgebra

For the optional constructed terminal instrument, the coherent computation into d records exactly the predicate defining Π′. Measuring only d therefore leaves the unnormalized logical branches Π′ρΠ′ and (I−Π′)ρ(I−Π′); reversing the conjunction and flag computation clears d,q within either branch without measuring the good component separately. This is the stated projective instrument. The direct mode supplies it by hypothesis.

2.1givenF1step 1.1constructalgebra

In the prepared state, the good and bad components are a ∣G⟩ and 1−a ∣B⟩. The coherent flag operation sets the temporary bit exactly on the good component; the controlled rotation places flag-1 amplitude r on that component and leaves the bad component with flag 0; uncomputing the temporary bit returns it to 0. Thus A′∣0′⟩ has good component ar ∣G⟩∣1⟩∣0⟩. Since ar=sin⁡2θ′, the modified pair (A′,Π′) has success weight sin⁡2θ′.

3.1givenF1F2F3F4F5step 2.1step 1.2step 1.3algebra

By step 1.2 the selected access modes implement the exact modified-pair iterates with external scratch reset after each call. The two-dimensional amplification plane is spanned by the good and bad components of A′∣0′⟩, both with T=0 by step 2.1; it therefore retains T=0. The rotation theorem [F2] applied after m iterates gives the following good probability. [given, F1, F2, F3, F4, F5, step 2.1, step 1.2, step 1.3, algebra] sin⁡2((2m+1)θ′)=sin⁡2 ⁣((2m+1)π4m+2)=sin⁡2(π/2)=1. By the projective outcome law [F3], its good branch occurs with probability one. Its conditional output has support in ran⁡Π′ by [F4]; the success flag is 1 and the temporary bit was uncomputed to 0 in step 2.1.

4.1givenF1F3F4∎

If a=1, the algorithm's direct branch prepares a state in ran⁡Πgood, so [F3] gives good-outcome probability one and [F4] gives its conditional support. If a=0, it returns fail without normalizing a zero good component and makes no claim that a good state exists.

Depends on

Used by

Dependency tree · two levels

49 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