Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generated
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.

Quantum counting as an expectation special case

Definition

Input. A Boolean domain X={0,1}n with N=2n, a predicate f:X→{0,1}, a phase-register size M=2m for an integer m≥2 (so M≥4), and the uniform coherent access and controlled membership reflection required by Quantum counting by uniform-state amplitude estimation. Let S={x:f(x)=1}.

Use the unchanged QA13 counting estimator Quantum counting by uniform-state amplitude estimation with this M and its supplied access model, and return its exact algebraic fraction estimate μ~=t~/N=sin⁡2(πy/M) for the expectation task. Its real-valued count estimate t~=Nμ~ may also be reported, with count and expectation outputs explicitly distinguished. Do not round to an integer unless that additional postprocessing and its cost are explicitly requested. By Uniform counting is finite indicator expectation, this is the QA29 expectation task for the uniform law and observable g=1S; the applicable count guarantee is Quantum counting error and boundary cases, whose phase-size hypothesis M≥4 is met. Divide its count-error radius by N for the expectation-error radius, with the same success event and probability. This item defines no second amplitude-estimation or counting routine.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

15 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