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.

Amplitude Estimation and Counting — Examples

1 · Prerequisites

2 · Summary

The worked case N=16, M=4 evaluates the generic count-error expression at zero, one, half, and all marked addresses, showing why the exact endpoint clauses sharpen the uniform bound. The counterexample compares I and −I: uncontrolled calls differ by a global phase, while their controlled blocks are distinguished on a control superposition. It makes explicit why controlled-power query counts require separately declared controlled access.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

Counting bounds at zero, one, half, and all marked

Example

Take N=16, M=4, and k=1. Evaluate the generic raw count error expression at t=0,1,8,16 and compare it with the endpoint certainty claims.

Facts & Assumptions

Given: N=16, M=4, k=1, and counts t∈{0,1,8,16}.

[F1]

The raw count error expression is 2πkt(N−t)/M+π2k2N/M2 (Quantum counting error and boundary cases).

[F2]

Counts t=0 and t=N are returned exactly when M is even (Quantum counting error and boundary cases).

Verification

1.1givenF1algebra

Substituting N=16,M=4,k=1 into [F1] gives the generic expression E(t)=π2t(16−t)+π2.

2.1givenF1F2step 1.1algebra

At t=0, this expression is π2 but [F2] sharpens the actual error to zero. At t=1, it is π152+π2. At t=8, it is 4π+π2. At t=16, the expression again equals π2, while [F2] gives exact output 16.

3.1F1F2step 2.1∎

The first-order term is zero at both endpoints and largest here at the half-count t=8; the second-order uniform term alone does not encode the exact endpoint behavior. All four substitutions agree with the theorem, and the endpoint cases use its explicit certainty clause.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedOpen item page →

A bare unitary oracle does not supply controlled powers for free

Statement refuted

A query bound stated in controlled powers of a unitary can always be read as the same gate or query bound for a bare uncontrolled unitary oracle, without separately supplying or charging controlled access.

Facts & Assumptions

Given: An access model that grants calls to an uncontrolled unitary U but does not separately grant controlled access.

[F1]

Controlled access is a separate block operator C(U)=diag⁡(I,U) and is not implied by an ordinary call (Controlled Unitary Access).

[F2]

The amplitude-estimation power-query and repeated-controlled-query counts assume the explicit controlled access mode (Amplitude-estimation query and precision complexity).

[F3]

The amplitude task requires explicit controlled-power access or repeated controlled-Q access. In repeated-unitary mode, the controlled-Q constituents must be supplied or implemented and charged; in power-query mode, each supplied power has its own declared cost vector (Amplitude estimation and counting input/output contract).

Counterexample

1.1givenF1algebra

Let the target be one-dimensional and compare U=I with U′=−I. An uncontrolled call to U′ differs from an uncontrolled call to U by a scalar phase on the target, so every fixed sequence of uncontrolled calls has the same physical outcome probabilities after any final measurement; global phase cancels from a vector's rank-one projector.

2.1givenF1F3step 1.1algebra

On a control qubit, however, C(I)=I while C(−I)=diag⁡(1,−1)=Z. On input ∣+⟩=(∣0⟩+∣1⟩)/2, the first returns ∣+⟩ and the second returns ∣−⟩=(∣0⟩−∣1⟩)/2; a computational-basis-independent X-basis measurement distinguishes them with certainty. Thus controlled access contains information absent from the uncontrolled phase-equivalence class.

3.1givenF2F3step 2.1∎

The cost theorem [F2] counts supplied controlled powers or repetitions of controlled Q only under the corresponding access declaration. In repeated-unitary mode the controlled-Q constituents must be charged; in power-query mode each supplied power carries its declared cost vector, including any implementation constituents. This witness proves that neither mode's controlled access is free from a bare uncontrolled oracle.

Sources