Alphabeta Math
Pipeline-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 Sampling, Expectation, and Monte Carlo — Examples

1 · Prerequisites

2 · Summary

The Bernoulli example identifies its mean with the QAE good probability and records the controlled-query cost. The counterexample shows that a classical sample-only interface does not itself supply the coherent preparation, inverse, controlled calls, or reflections required by the quantum estimators; a separately costed coherent implementation may still be added.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Sample-only access is not coherent sampler access

Statement refuted

A classical interface that returns independent samples from a finite law, by itself, supplies a coherent unitary sampler together with its inverse, controlled calls, value computation, and state reflections at no additional cost.

Facts & Assumptions

Given: A sample-only procedure whose sole operation returns a classical sample; it exposes no circuit or oracle acting on quantum registers.

[F1]

Coherent finite sampler and observable value requires an explicitly supplied unitary V with the stated coherent output state, as well as explicit inverse and controlled access and the value/rotation interfaces.

Counterexample

1.1givenconstruct

Let D be a classical procedure that, on each call, returns a bit x∈{0,1} with Pr⁡(x=1)=p. Its interface is a classical input/output map from a fresh random seed to a bit; it has no quantum-register input and specifies no unitary V.

2.1givenF1step 1.1algebra

The law of D does not provide a circuit for V∣0⟩=1−p∣0⟩∣0⟩∣w0⟩+p∣1⟩∣1⟩∣w1⟩, nor circuits for V†, controlled V, value rotations, or reflections. Thus the sample-only object fails the explicit interface required by [F1] and cannot be substituted directly into QA29's coherent-query bound.

3.1F1step 2.1∎

This refutes the statement about the interface alone. It does not rule out constructing a separate coherent preparation circuit from additional information about p; such a circuit and all its costs would be new supplied inputs.

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Bernoulli mean as a good-state probability

Example

Let X∈{0,1} have Pr⁡(X=1)=p and use g(X)=X on the range [0,1]. Suppose a coherent sampler for this law and its explicitly costed inverse/controlled operations are supplied.

Facts & Assumptions

Given: The Bernoulli law, the observable g(x)=x, and a coherent sampler that prepares its finite law.

[F1]

Finite expectation-estimation task: μ=∑xpxg(x).

[F2]

Coherent finite sampler and observable value: the specified finite unitary preparation is an explicit input, with inverse, controlled, and rotation costs declared.

[F3]

Measurement law of a coherent sampler: measuring the sample register returns x with probability px.

[F4]

Amplitude-estimation expectation estimator uses the affine value q(x)=(g(x)−a)/(b−a) and a good flag.

[F5]

Quantum bounded-expectation guarantee and query cost gives its success and query guarantee.

Verification

1.1givenF1F3F4algebra

Here μ=(1−p)⋅0+p⋅1=p by [F1] and the two-point law [F3]. The range is [a,b]=[0,1], so [F4] gives q(x)=x.

2.1F3F4step 1.1algebra

Conditional on sample x, the controlled rotation places good probability x. Averaging over the sample law, the total good probability is (1−p)⋅0+p⋅1=p=μ.

3.1givenF2F5step 2.1∎

Thus the QA13 amplitude estimator is estimating the Bernoulli mean itself; [F5] yields additive error ε with confidence 1−δ in either declared access mode. In repeated controlled-Q access it uses O(ε−1(1+ln⁡(1/δ))) 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.

Sources