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.
Unknown-amplitude search has no false positives and halts almost surely
Statement
For , let . For every integer , the second fresh sample with uniform on has good-outcome probability For every , the procedure Unknown-amplitude randomized search returns a good output with probability . If , it never returns a good output and does not halt.
Facts & Assumptions
Given: The fresh-register schedule, the good/bad measurement, and the verification rule in the algorithm.
Unknown-amplitude randomized search: every round begins with a direct fresh sample, and its second fresh sample uses a uniform ; only verified good outputs are returned.
Exact success probability after amplitude amplification: conditional on the second sample using iterates, its good probability is .
Projective measurement outcome weights are probabilities: the good/bad projective instrument assigns the good branch its Born probability.
Conditional state for a projective measurement: a positive-probability good branch has a conditional state supported in the good projection.
, and the complex exponential extends the real exponential and , , and : finite complex exponentials multiply by adding their exponents, and .
Proof
Assume , and let satisfy . The identity gives The cosine sum is the real part of . By [F6], this finite geometric sum has modulus Taking real parts therefore gives
If , then . Since , some finite round has , after which [F1]–[F2] give a conditional per-round success probability at least . If , the direct sample in each round succeeds with probability at least . Thus in either case there is a finite round after which every fresh round has conditional success probability bounded below by a fixed positive constant.
Registers and randomness are fresh each round, so after rounds beyond the finite threshold in step 2.1, the probability of still not returning is at most in the first case and in the second. Both tend to zero. Since every output is returned only after the good instrument outcome (and verification when required), no bad output is returned; on every positive-probability good branch [F4] supplies its conditional state.
If , every fresh preparation has zero projection onto , so each good outcome has probability zero by [F3]. The procedure therefore never returns and runs forever, as specified in [F1].
Depends on
- Unknown-amplitude randomized search
- Exact success probability after amplitude amplification
- Projective measurement outcome weights are probabilities
- Conditional state for a projective measurement
- A unit-vector outer product is a density operator
- Expected query cost from finite execution prefixes
- 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
- $\exp(z+w)=\exp z\,\exp w$, and the complex exponential extends the real exponential
- $\exp(x+iy)=e^x(\cos y+i\sin y)$, $|\exp(x+iy)|=e^x$, and $e^{i\pi}+1=0$
- 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
- The addition formulas for sine and cosine
Used by
Dependency tree · two levels
68 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)