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 for every . The branch returns fail and makes no claim that a good output exists.
Facts & Assumptions
Given: The exact-success algorithm, its known weight , and its supplied coherent flag operation, rotations, and the selected enlarged-reflection and terminal-instrument implementations.
Exact success amplification by attenuating the good branch: for , the chosen satisfy the displayed formulas, and every iterate uses the modified pair with the explicitly specified access modes.
Exact success probability after amplitude amplification: a prepared state with good weight has good probability after standard iterates.
Projective measurement outcome weights are probabilities: the good measurement weight is the probability of that outcome.
Conditional state for a projective measurement: on a positive-probability projective branch, the conditional state is supported in the measured projection range.
The addition formulas for complex trigonometric and hyperbolic functions and Parity and the Pythagorean identity for sine and cosine: the angle-addition and identities hold.
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: , and cosine is positive before its first positive zero ; hence sine is increasing on .
Proof
The algorithm sets , so . Multiplying by gives , hence and . By sine monotonicity in [F6], , so and the two nonnegative square roots used in the supplied flag rotation are defined.
In the constructed zero reflection, on fixed logical flag/temporary bits , the four gates and two Toffolis compute and then erase . The data sees exactly when , and identity otherwise. This is . In the constructed good reflection, split any data vector as with . The first flag call records on and on in ; multiplies only with by , and the inverse flag call clears . Thus it is for arbitrary . Linearity extends both calculations to every logical vector with clean external scratch. Direct modes supply these same operators by hypothesis.
For the optional constructed terminal instrument, the coherent computation into records exactly the predicate defining . Measuring only therefore leaves the unnormalized logical branches and ; reversing the conjunction and flag computation clears within either branch without measuring the good component separately. This is the stated projective instrument. The direct mode supplies it by hypothesis.
In the prepared state, the good and bad components are and . The coherent flag operation sets the temporary bit exactly on the good component; the controlled rotation places flag- amplitude on that component and leaves the bad component with flag ; uncomputing the temporary bit returns it to . Thus has good component . Since , the modified pair has success weight .
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 , both with by step 2.1; it therefore retains . The rotation theorem [F2] applied after iterates gives the following good probability. [given, F1, F2, F3, F4, F5, step 2.1, step 1.2, step 1.3, algebra] By the projective outcome law [F3], its good branch occurs with probability one. Its conditional output has support in by [F4]; the success flag is and the temporary bit was uncomputed to in step 2.1.
If , the algorithm's direct branch prepares a state in , so [F3] gives good-outcome probability one and [F4] gives its conditional support. If , it returns fail without normalizing a zero good component and makes no claim that a good state exists.
Depends on
- Exact success amplification by attenuating the good branch
- Exact success probability after amplitude amplification
- Projective measurement outcome weights are probabilities
- Conditional state for a projective measurement
- Complex sine, cosine, hyperbolic sine, and hyperbolic cosine from the complex exponential
- The addition formulas for complex trigonometric and hyperbolic functions
- Parity and the Pythagorean identity for sine and cosine
- Pi as twice the smallest positive zero of cosine
- Quarter-turn values and shifts by pi/2 and pi
- The derivatives of sine and cosine are cosine and minus sine
- Cosine has a smallest positive zero, lying strictly between zero and two
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
- Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp, Quantum Amplitude Amplification and Estimation (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)