Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-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.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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