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 but does not separately grant controlled access.
Controlled access is a separate block operator and is not implied by an ordinary call (Controlled Unitary Access).
The amplitude-estimation power-query and repeated-controlled-query counts assume the explicit controlled access mode (Amplitude-estimation query and precision complexity).
The amplitude task requires explicit controlled-power access or repeated controlled- access. In repeated-unitary mode, the controlled- 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
Let the target be one-dimensional and compare with . An uncontrolled call to differs from an uncontrolled call to 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.
On a control qubit, however, while . On input , the first returns and the second returns ; a computational-basis-independent -basis measurement distinguishes them with certainty. Thus controlled access contains information absent from the uncontrolled phase-equivalence class.
The cost theorem [F2] counts supplied controlled powers or repetitions of controlled only under the corresponding access declaration. In repeated-unitary mode the controlled- 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
- Brassard, Høyer, Mosca, and Tapp, Quantum Amplitude Amplification and Estimation, complete article, §§4–5, Theorems 11–18 (standard reference, not scraped)
- Andrew M. Childs, Lecture Notes on Quantum Algorithms, complete lecture notes, §§19.1–19.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, complete 239-page notes, §7.3 (standard reference, not scraped)