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 probability after amplitude amplification
Statement
Let be the initial success weight and let be the unique angle satisfying . After exactly standard amplitude-amplification iterates, the probability of the good outcome of is The endpoints and are included by direct evaluation, without normalizing a zero component.
Facts & Assumptions
Given: The sampler, success projection, and integer in the Statement.
Amplitude-amplification invariant plane: for , the ordered matrix of is the rotation through ; at , the prepared vector is fixed up to phase.
A unit-vector outer product is a density operator: the outer product of a unit vector is a density operator.
Projective measurement outcome weights are probabilities: for a density operator , the probability of the outcome projection is .
The addition formulas for complex trigonometric and hyperbolic functions: sine and cosine satisfy the real angle-addition identities; Parity and the Pythagorean identity for sine and cosine gives .
Signs, monotonicity intervals, and ranges of sine and cosine: sine is strictly increasing on , so has a unique for each .
Proof
Assume . The initial coordinates in the invariant ordered basis are . Multiplication by the matrix in [F1] and the addition formulas in [F4] send to . Starting at , induction on therefore gives coordinates after iterates.
The good component is the second coordinate, so its squared norm is . The prepared unit vector gives a density operator by [F2], and [F3] identifies this squared component norm with the projective-measurement outcome probability.
If , then and [F1] gives success probability . If , then ; [F1] changes only the global sign on each iterate, and [F5] gives . Thus the same formula holds at both endpoints.
Depends on
- Amplitude amplification with a fixed integer iteration count
- Amplitude-amplification invariant plane
- Projector Reflections Are Hermitian Unitary Involutions
- Projective measurement outcome weights are probabilities
- A unit-vector outer product is a density operator
- 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
- Pi is the first positive zero of sine
- Signs, monotonicity intervals, and ranges of sine and cosine
Used by
- A fixed Grover iteration count can fail when a is unknown Counterexample
- A prepared state with success amplitude one half Example
- Finite amplification preserves the good state with a deterministic call cap Lemma
- Finite capped amplification succeeds with a supplied lower bound Lemma
- Low-target amplification has a controlled multiplicative loss Lemma
- Exact success for known positive amplitude with explicit dilution Theorem
- Expected cost of unknown-amplitude search Theorem
- Known-amplitude success bound Theorem
- Unknown-amplitude search has no false positives and halts almost surely Theorem
- Variable-time amplitude-amplification theorem Theorem
Dependency tree · two levels
55 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)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)