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.
Hermitian block-encoding signal subspaces
Statement
Let be an exact Hermitian block encoding from Qubitization access model, and choose an orthonormal eigenbasis . Put and . For , define The are orthonormal in , as are the . In the paired input basis and output basis , has matrix The unitary maps in the reverse direction by the same matrix. If , the complement is absent and ; no division by zero is used. The value is an ordinary two-dimensional signal plane.
Facts & Assumptions
Given: A finite-dimensional self-adjoint , an exact block encoding, and the associated signal projector .
Qubitization access model: and ; taking adjoints and using gives .
PUE singular-space invariant decomposition: the positive singular pairs of a projected unitary give orthogonal paired two-dimensional subspaces; their endpoint complements are absent.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: a finite-dimensional self-adjoint endomorphism has an orthonormal eigenbasis with real eigenvalues.
The adjoint is characterised by : , so a unitary and its adjoint preserve inner products.
Finite block encoding: the normalized compression has operator norm at most one, hence .
Proof
Given: As in Facts & Assumptions.
Fix an eigenvector with unit norm and write . From [F1], and , because . Since preserve norm, orthogonal decomposition by gives . For , the displayed are therefore unit vectors in .
If , orthogonality of eigenvectors and [F4] give , while . Subtracting the projected components shows ; the same calculation for proves orthogonality of the .
Decomposing into its and parts gives . Also Division by yields , which is the second column of the displayed matrix. Taking adjoints gives the reverse-basis action of .
If , the orthogonal complement of has squared norm , so ; the same argument for gives . Thus the endpoint plane collapses. At , step 1.1 has , so both normalized vectors are well-defined. The mutually orthogonal paired spaces and endpoint lines exhaust the clean input and output signal spaces by the SVD decomposition in [F2]; their orthogonal residual complements stay in and cannot contribute to the clean compression.
Depends on
- Qubitization access model
- Finite block encoding
- PUE singular-space invariant decomposition
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
Used by
Dependency tree · two levels
34 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 29 §29.3 (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, Chapter 9 §9.4 (standard reference, not scraped)
- András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe, Quantum singular value transformation and beyond (standard reference, not scraped)