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.
LCU projected-block correctness
Statement
Under the exact inputs and instructions of LCU block-encoding construction, the all-zero coefficient-index and component-ancilla block of is
Moreover, , so the constructed unitary is an block encoding of .
Facts & Assumptions
Given: The finite component matrices, exact block encodings, positive , nonzero coefficients, supplied unitary , and SELECT defined in LCU block-encoding construction.
LCU block-encoding construction: , and SELECT applies phase followed by the padded in branch .
Finite block encoding: the exact all-zero compression of each padded is .
The inner-product norm is definite, homogeneous, and satisfies the triangle inequality: the vector norm satisfies the triangle inequality.
The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||: the operator norm is the maximum action on unit vectors.
Proof
Let . The amplitude list is normalized because . Identity-padding a component ancilla preserves its unitary and contributes factor to its all-zero block, so by [F2] its compression remains . SELECT is unitary because it is block diagonal on orthogonal index subspaces, with each block a unit-modulus phase times a unitary (and identity on unused labels); hence is unitary. Projecting SELECT onto the common component-ancilla zero state replaces each by , so the full projected block of is the coefficient-register matrix element of .
The amplitudes in [F1] are real and nonnegative, so the and entries of and in this matrix element both equal . Expanding gives , as claimed.
For every unit vector , [F3] and [F4] give . Taking the maximum over unit yields . Since , the definition of block encoding applies with zero error.
Depends on
Used by
- A bounded polynomial approximation to a scaled exponential Example
- Two-term LCU normalization and access count Example
- Block-encoding normalization, error, and cost accounting Theorem
- Certified finite smooth Fourier approximation and LCU normalization Theorem
- Matrix-function transformation error and resource bound Theorem
Dependency tree · two levels
25 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, Chapter 28 §28.3 (17 April 2025) (standard reference, not scraped)
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond, Lemma 52 (standard reference, not scraped)