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.
Bernoulli mean as a good-state probability
Example
Let have and use on the range . Suppose a coherent sampler for this law and its explicitly costed inverse/controlled operations are supplied.
Facts & Assumptions
Given: The Bernoulli law, the observable , and a coherent sampler that prepares its finite law.
Coherent finite sampler and observable value: the specified finite unitary preparation is an explicit input, with inverse, controlled, and rotation costs declared.
Measurement law of a coherent sampler: measuring the sample register returns with probability .
Amplitude-estimation expectation estimator uses the affine value and a good flag.
Quantum bounded-expectation guarantee and query cost gives its success and query guarantee.
Verification
Here by [F1] and the two-point law [F3]. The range is , so [F4] gives .
Conditional on sample , the controlled rotation places good probability . Averaging over the sample law, the total good probability is .
Thus the QA13 amplitude estimator is estimating the Bernoulli mean itself; [F5] yields additive error with confidence in either declared access mode. In repeated controlled- access it uses controlled sampler/reflection rounds; in supplied controlled-power access its power queries retain their separately declared prices. The circuit costs remain those declared by the supplied sampler.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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
- Ashley Montanaro, Quantum speedup of Monte Carlo methods, Theorem 3 (standard reference, not scraped)
- Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp, Quantum Amplitude Amplification and Estimation, Theorem 12 (standard reference, not scraped)