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.
Adversary progress at initial and bounded-error final states
Statement
Let be an admissible real symmetric adversary matrix, vanishing on every equal-output pair, as in General adversary matrix and spectral bound. For a standard XOR query algorithm in the ordinary oracle-only model that outputs with probability at least for every , where , purify its final states and define where α is a real unit eigenvector of Γ with eigenvalue of magnitude ||Γ||. Then |W_0|=||Γ|| and
Facts & Assumptions
Given: An ordinary oracle-only query algorithm for a finite Boolean function, an admissible real symmetric adversary matrix Γ, and a normalized principal eigenvector α.
General adversary matrix and spectral bound: Γ is real symmetric, vanishes on equal-output pairs, and has norm ||Γ||.
Finite Boolean query problem and error model for adversary bounds: the function has finite domain D and Boolean output.
Pure state and ray: each purified algorithm branch has a unit state vector.
Quantum acceptance probability for a finite promise computation: acceptance probability is the squared norm of the output-one projection.
Unitary normal form for finite bit-query algorithms without extra queries: measurements can be deferred into a final output projection without increasing queries.
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.
Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.
Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition: a finite real matrix has a singular-value decomposition with orthonormal left and right singular vectors; its transpose has the same singular values.
The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector: the operator norm is the largest singular value.
Cauchy–Schwarz: , with equality exactly for dependent pairs: finite-dimensional inner products satisfy the Cauchy–Schwarz inequality.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the induced Euclidean norm.
Proof
If Γ=0, then W_0=W_T=0 and both endpoint bounds hold. Assume Γ≠0. By [F6], choose a real orthonormal eigenbasis; the induced norm [F11] then gives a real unit eigenvector α of Γ with eigenvalue λ satisfying |λ|=||Γ||. Since Γ has only cross-output blocks, write Γ=[[0,B],[B^T,0]] with respect to the two nonempty output classes. The SVD [F8] and largest-singular-value characterization [F9] show ||Γ||=||B||: for any (a,b), ||Γ(a,b)||²=||Bb||²+||B^Ta||²≤||B||²(||a||²+||b||²), and a top right singular vector of B attains equality. The eigenvector equations imply α_0^{\mathsf T}Bα_1=λ||α_0||²=λ||α_1||²; because λ≠0, the class norms are equal, hence each is 1/√2. Initially all x-dependent states are identical, so W_0=Σ_xyΓ_xyα_xα_y=α^TΓα=λ.
By [F5], represent the terminal computation by unit vectors ψ_x and an output-one projection P. For x with f(x)=0 put a_x=Pψ_x, b_x=(I−P)ψ_x; for y with f(y)=1 put c_y=Pψ_y, d_y=(I−P)ψ_y. The per-input error hypothesis gives p_x=||a_x||²≤ε and q_y=||c_y||²≥1−ε. Orthogonality of the two measurement subspaces gives ⟨ψ_x|ψ_y⟩=⟨a_x|c_y⟩+⟨b_x|d_y⟩.
If ε=0, then a_x=d_y=0 for every opposite-output pair, so all such overlaps vanish and W_T=0. Suppose 0<ε<1/2. Set r=(1−ε)/ε, b=√(ε/(1−ε)), and a=rb=√((1−ε)/ε). Define u_x=(√a,a_x,√b,b_x) and v_y=(a^{-1/2}c_y,b^{-1/2}d_y). Then ⟨u_x|v_y⟩=⟨ψ_x|ψ_y⟩. Since a≥b, the bounds p_x≤ε and q_y≥1−ε give ||u_x||²≤aε+b(1−ε)=2√(ε(1−ε)), ||v_y||²≤(1−ε)/a+ε/b=2√(ε(1−ε)). Thus the cross-overlap matrix has a factorization with both squared vector norms at most c:=2√(ε(1−ε)).
Choose an orthonormal basis of the finite state space by [F7], and write , . For each r set and . The cross-output contribution is . By Cauchy–Schwarz [F10] and the induced norm definition [F11], each term is bounded by : the real SVD in [F8] also acts unitarily on complex coordinates, so [F9] gives . Summing and applying real Cauchy–Schwarz to the nonnegative norms gives . By step 2.1 this is at most . The reverse-output block contributes the complex conjugate, hence . Together with the case this proves the endpoint bound.
Depends on
- General adversary matrix and spectral bound
- Finite Boolean query problem and error model for adversary bounds
- Pure state and ray
- Quantum acceptance probability for a finite promise computation
- Quantum query algorithm
- Unitary normal form for finite bit-query algorithms without extra queries
- Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Every finite-dimensional real or complex inner product space has an orthonormal basis
- Every linear map between finite-dimensional real or complex inner product spaces admits a singular value decomposition
- The operator norm is 0 on the zero domain and otherwise equals the largest singular value, attained at a right-singular vector
- The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||
Used by
Dependency tree · two levels
58 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)