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.
One oracle call changes adversary progress by at most filtered spectral norm
Statement
In the unitary normal form of an ordinary oracle-only standard XOR bit-query algorithm, one oracle call changes the progress of Adversary progress at initial and bounded-error final states by at most
Facts & Assumptions
Given: An admissible Γ, normalized principal eigenvector α, and the pre-query states of a unitary-normal-form algorithm.
General adversary matrix and spectral bound: Γ is a finite real symmetric adversary matrix and Γ∘Δ_i is its i-th filtered block.
Input-mismatch masks and entrywise filtering: Δ_i(x,y)=1 exactly when x_i≠y_i.
Query-address projectors for bit-oracle algorithms: the address projectors are orthogonal and sum to identity.
Standard bit-flip query convention: O_x applies X^{x_i} to the response bit at address i.
Unitary normal form for finite bit-query algorithms without extra queries: input-independent unitaries separate standard XOR query calls.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a finite real symmetric matrix has an orthonormal real eigenbasis.
Adversary progress at initial and bounded-error final states: the progress quantity is for the pre/post-query states and the chosen normalized principal eigenvector .
The adjoint is characterised by : the adjoint satisfies .
The basis-independent trace of an endomorphism of a finite-dimensional vector space: trace is basis-independent and is the sum of diagonal entries in any basis.
Proof
An input-independent unitary between queries preserves every pairwise inner product, so only the oracle slot changes progress. For inputs x,y, the product O_x^*O_y acts at address i as X^{x_i⊕y_i}; in the response eigenstate |−⟩=(|0⟩−|1⟩)/√2 this is −1 exactly when x_i≠y_i, and it is +1 on |+⟩. Therefore O_x^*O_y−I=−2Σ_iΔ_i(x,y)P_i^-, where P_i^- is the address-i projector tensored with |−⟩⟨−| on response and identity on work.
Let ψ_x be the pre-query state and define Q_i:C^D→H by Q_i|x⟩=α_xP_i^-ψ_x. Substituting step 1.1 into W_{t+1}−W_t and collecting entries gives W_{t+1}−W_t=−2Σ_i tr((Γ∘Δ_i)Q_i^*Q_i) because Γ∘Δ_i is real symmetric and relabeling the two indices gives the trace exactly.
Fix i and write and . By [F6], has a real orthonormal eigenbasis with eigenvalues , and . Evaluating the basis-independent trace [F9] in this basis and using [F8] gives , so . Evaluating in the standard input basis yields . Therefore , since the are orthogonal subprojections of identity. Hence .
Depends on
- General adversary matrix and spectral bound
- Input-mismatch masks and entrywise filtering
- Query-address projectors for bit-oracle algorithms
- Standard bit-flip query convention
- Quantum query algorithm
- Unitary normal form for finite bit-query algorithms without extra queries
- Adversary progress at initial and bounded-error final states
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
Used by
Dependency tree · two levels
44 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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (17 April 2025) (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, arXiv:1907.09415v6 (standard reference, not scraped)